#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 20;
int a[maxn], b[maxn];
bool in[maxn];
long long int sumA, sumB;
long long int allA, allB;
int c[maxn];
int n, en;
bool ok() {
  long long int ta = 0, tb = 0;
  for (int i = 1; i <= en; ++i) {
    ta += 2 * a[c[i]];
    tb += 2 * b[c[i]];
    if (ta > allA && tb > allB) return true;
  }
  return false;
}
void work() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    allA += a[i];
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &b[i]);
    allB += b[i];
    c[i] = i;
  }
  en = (n) / 2 + 1;
  while (!ok()) {
    random_shuffle(c + 1, c + 1 + n);
  }
  cout << en << endl;
  for (int i = 1; i <= en; ++i) {
    printf("%d ", c[i]);
  }
}
int main() {
  work();
  return 0;
}
