#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  scanf(" %d", &n);
  vector<int> a(n), b(n);
  for (int(i) = 0; (i) < (int)(n); ++(i)) scanf(" %d", &a[i]);
  for (int(i) = 0; (i) < (int)(n); ++(i)) scanf(" %d", &b[i]);
  int k = n / 2 + 1;
  long long A = 0, B = 0;
  for (int(i) = 0; (i) < (int)(n); ++(i)) {
    A += a[i];
    B += b[i];
  }
  vector<int> p(n);
  iota((p).begin(), (p).end(), 0);
  while (1) {
    long long sa = 0, sb = 0;
    for (int(i) = 0; (i) < (int)(k); ++(i)) {
      sa += a[p[i]];
      sb += b[p[i]];
    }
    if (sa * 2 > A && sb * 2 > B) break;
    shuffle((p).begin(), (p).end(), mt19937(time(0)));
  }
  printf("%d\n", k);
  for (int(i) = 0; (i) < (int)(k); ++(i)) {
    if (i) printf(" ");
    printf("%d", p[i] + 1);
  }
  printf("\n");
  return 0;
}
