#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100000;
int as[MAX_N], bs[MAX_N], xs[MAX_N], ps[MAX_N];
bool ltax(const int a, const int b) { return as[a] > as[b]; }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  for (int i = 0; i < n; i++) scanf("%d", bs + i);
  iota(xs, xs + n, 0);
  sort(xs, xs + n, ltax);
  int k = 0, i = 0;
  ps[k++] = xs[i++];
  for (; i + 1 < n; i += 2)
    ps[k++] = (bs[xs[i]] >= bs[xs[i + 1]]) ? xs[i] : xs[i + 1];
  if (i < n && k < n / 2 + 1) ps[k++] = xs[i++];
  printf("%d\n", k);
  for (int i = 0; i < k; i++)
    printf("%d%c", ps[i] + 1, (i + 1 < k) ? ' ' : '\n');
  return 0;
}
