#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
const int INF = (int)1e9 + 7, mod = (int)1e9 + 9, pw = 31, N = (int)1e5 + 123,
          M = (int)1e6 + 123;
const double eps = 1e-11;
const long long inf = 1e18;
int n, k, ans[N];
ll suma, sumb, a[N], b[N];
inline void add(int i) {
  suma -= 2ll * a[i];
  sumb -= 2ll * b[i];
}
inline void rem(int i) {
  suma += 2ll * a[i];
  sumb += 2ll * b[i];
}
ll res() { return max(0ll, suma) + max(0ll, sumb); }
int main() {
  srand(time(0));
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n;
  k = n / 2 + 1;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    suma += a[i];
    ans[i] = i;
  }
  for (int i = 1; i <= n; i++) {
    cin >> b[i];
    sumb += b[i];
  }
  for (int i = 1; i <= k; i++) {
    add(ans[i]);
  }
  long double T = 32;
  while (suma > 0 || sumb > 0) {
    ll last = res();
    int l = rand() % k + 1, r = rand() % (n - k) + k + 1;
    add(ans[r]);
    rem(ans[l]);
    double d = res() - last;
    if (d < 0 || exp(-d / T) > double(rand() % 1024) / 1024.) {
      swap(ans[l], ans[r]);
    } else {
      rem(ans[r]);
      add(ans[l]);
    }
    T *= 0.97;
  }
  cout << k << "\n";
  for (int i = 1; i <= k; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
