#include <bits/stdc++.h>
using namespace std;
int a[100009], b[100009], id[100009];
bool comp(int i, int j) {
  if (a[i] != a[j])
    return a[i] > a[j];
  else
    return b[i] > b[j];
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  a[n] = -1;
  for (int i = 0; i < n; i++) {
    scanf("%d", &b[i]);
    id[i] = i;
  }
  b[n] = -1;
  id[n] = n;
  sort(id, id + n, &comp);
  vector<int> ans;
  ans.push_back(id[0]);
  for (int i = 1; i < n; i += 2) {
    if (b[id[i]] >= b[id[i + 1]])
      ans.push_back(id[i]);
    else
      ans.push_back(id[i + 1]);
  }
  sort(ans.begin(), ans.end());
  printf("%d\n", ans.size());
  for (int i = 0; i < (int)ans.size(); i++) {
    printf("%d ", ans[i] + 1);
  }
  printf("\n");
  return 0;
}
