#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int lcm(long long int a, long long int b) {
  return a * b / gcd(a, b);
}
const int N = 1000 * 100 + 10;
int n, a[N], b[N], idx[N];
long long int A, B;
bool ok() {
  long long int suma = 0;
  long long int sumb = 0;
  for (int i = 1; i <= n / 2 + 1; i++) suma += a[idx[i]], sumb += b[idx[i]];
  return 2 * suma > A && 2 * sumb > B;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", a + i), A += a[i];
  for (int i = 1; i <= n; i++) scanf("%d", b + i), B += b[i];
  iota(idx + 1, idx + 1 + n, 1);
  while (!ok()) random_shuffle(idx + 1, idx + 1 + n);
  printf("%d\n", n / 2 + 1);
  for (int i = 1; i <= n / 2 + 1; i++) printf("%d ", idx[i]);
  puts("");
  return 0;
}
