#include <bits/stdc++.h>
using namespace std;
int N;
pair<pair<int, int>, int> V[100005];
vector<int> r;
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first != b.first.first) return a.first.first > b.first.first;
  return a.first.second > b.first.second;
}
int main() {
  cin.sync_with_stdio(false);
  cout.sync_with_stdio(false);
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> V[i].first.first;
  for (int i = 1; i <= N; i++) {
    cin >> V[i].first.second;
    V[i].second = i;
  }
  sort(V + 1, V + 1 + N, cmp);
  r.push_back(V[1].second);
  for (int i = 2; i <= N; i += 2) {
    if (V[i].first.second > V[i + 1].first.second)
      r.push_back(V[i].second);
    else
      r.push_back(V[i + 1].second);
  }
  cout << r.size() << "\n";
  for (auto it : r) cout << it << " ";
  return 0;
}
