#include <bits/stdc++.h>
using namespace std;
const int inf = 0x7fffffff;
const int maxn = 1e5 + 100;
struct node {
  int v;
  int id;
  bool operator<(const node &b) const { return v > b.v; }
} a[maxn];
int b[maxn];
vector<int> ans;
int main(void) {
  int n;
  scanf("%d", &n);
  int sum1 = 0, sum2 = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i].v);
    sum1 += a[i].v;
    a[i].id = i;
  }
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &b[i]);
    sum2 += b[i];
  }
  ans.push_back(a[0].id);
  for (int i = 1; i < n - 1; i += 2) {
    if (b[a[i].id] > b[a[i + 1].id])
      ans.push_back(a[i].id);
    else
      ans.push_back(a[i + 1].id);
  }
  printf("%d\n", n / 2 + 1);
  if (n % 2 == 0) ans.push_back(a[n - 1].id);
  for (unsigned i = 0; i < ans.size(); i++) printf("%d ", ans[i] + 1);
  puts("");
  return 0;
}
