#include <bits/stdc++.h>
using namespace std;
int rand(int l, int r) {
  static std::mt19937 rng(
      std::chrono::steady_clock::now().time_since_epoch().count());
  static std::uniform_int_distribution<int> ludo(l, r);
  return ludo(rng);
}
void shuffle(vector<int> &vec) {
  int n = vec.size();
  for (int i = 0; i < n; i++) {
    int p = i + (rand(1, 1 << 30) % (n - i));
    swap(vec[i], vec[p]);
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  int N;
  long long sa = 0, sb = 0;
  cin >> N;
  vector<int> A(N), B(N), ind(N);
  iota(ind.begin(), ind.end(), 0);
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
    sa += A[i];
  }
  for (int i = 0; i < N; ++i) {
    cin >> B[i];
    sb += B[i];
  }
  int ok = (N >> 1) + 1;
  while (1) {
    static mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    long long x = 0, y = 0;
    shuffle(ind);
    for (int i = 0; i < ok; ++i) {
      x += A[ind[i]];
      y += B[ind[i]];
    }
    if (x << 1LL > sa && y << 1LL > sb) {
      cout << ok << '\n';
      for (int i = 0; i < ok; ++i) {
        cout << ind[i] + 1 << ' ';
      }
      exit(0);
    }
  }
  return 0;
}
