#include <bits/stdc++.h>
using namespace std;
struct Node {
  int x;
  int id;
} a[100005];
bool cmp(Node a, Node b) { return a.x > b.x; }
int b[100005];
int main() {
  int n;
  int str[100005], cnt = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].x);
    a[i].id = i;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &b[i]);
  }
  sort(a + 1, a + n + 1, cmp);
  printf("%d\n", n / 2 + 1);
  printf("%d", a[1].id);
  for (int i = 2; i < n; i += 2) {
    if (b[a[i].id] > b[a[i + 1].id])
      printf(" %d", a[i].id);
    else
      printf(" %d", a[i + 1].id);
  }
  if (!(n & 1)) printf(" %d", a[n].id);
  return 0;
}
