#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
const int N = 100005;
int a[N];
int b[N];
int main() {
  ios ::sync_with_stdio(false);
  cin.tie(0);
  cout.precision(10);
  cout << fixed;
  int n;
  cin >> n;
  vector<pair<int, int> > c;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    c.push_back({a[i], i});
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  sort(c.begin(), c.end());
  reverse(c.begin(), c.end());
  vector<int> p;
  int k = 0;
  if (n % 2 == 1) {
    p.push_back(c[k].second);
    k++;
  } else {
    p.push_back(c[k].second);
    k++;
    p.push_back(c[k].second);
    k++;
  }
  for (; k < n; k += 2) {
    if (b[c[k].second] > b[c[k + 1].second]) {
      p.push_back(c[k].second);
    } else {
      p.push_back(c[k + 1].second);
    }
  }
  cout << (n / 2 + 1) << "\n";
  for (int i = 0; i < p.size(); i++) {
    if (i != 0) {
      cout << " ";
    }
    cout << (p[i] + 1);
  }
  cout << "\n";
}
