#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
const int INF = 0x7ffffff;
const int MOD = 1e9 + 7;
int a[MAXN + 17], b[MAXN + 17], id[MAXN + 17];
bool cmp(int c, int d) { return a[c - 1] > a[d - 1]; }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) cin >> b[i];
  for (int i = 0; i < n; ++i) id[i] = i + 1;
  sort(id, id + n, cmp);
  cout << n / 2 + 1 << endl;
  cout << id[0] << endl;
  if (!(n & 1)) cout << id[1] << endl;
  int t = (n & 1) ? n / 2 : n / 2 - 1, j;
  for (j = n - 1; t > 0; t--, j -= 2)
    cout << (b[id[j] - 1] > b[id[j - 1] - 1] ? id[j] : id[j - 1]) << " ";
  return 0;
}
