#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n, ind[maxn], a[maxn], b[maxn];
bool cmp(int x, int y) { return a[x] > a[y]; }
void solve() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < n; i++) scanf("%d", &b[i]);
  for (int i = 0; i <= n; i++) ind[i] = i;
  sort(ind, ind + n, cmp);
  int k = n / 2 + 1;
  printf("%d\n%d", k, ind[0] + 1);
  for (int i = 1; i < k; i++) {
    printf(" %d", 1 + (b[ind[i * 2 - 1]] > b[ind[i * 2]] ? ind[i * 2 - 1]
                                                         : ind[i * 2]));
  }
}
int main() {
  solve();
  return 0;
}
