#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
int a[maxn];
int b[maxn];
int n;
int p[maxn];
bool cmp(const int &x, const int &y) { return a[x] > a[y]; }
int main() {
  while (scanf("%d", &n) != EOF) {
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for (int i = 1; i <= n; i++) {
      scanf("%d", &b[i]);
    }
    for (int i = 1; i <= n; i++) p[i] = i;
    sort(p + 1, p + n + 1, cmp);
    printf("%d\n", n / 2 + 1);
    printf("%d", p[1]);
    for (int i = 2; i < n; i += 2) {
      int x = p[i], y = p[i + 1];
      if (b[x] > b[y])
        printf(" %d", x);
      else
        printf(" %d", y);
    }
    if (n % 2 == 0) printf(" %d", p[n]);
    cout << endl;
  }
  return 0;
}
