#include <bits/stdc++.h>
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'
const int MXA = (1 << 20) - 1, MXH = (1 << 10) - 1, MXN = 1e5;
int bc[MXA+2], bestVal[MXH+2][MXH+2][21], bestIdx[MXH+2][MXH+2][21], nxt[MXN+1];
int main() {
#ifdef shiven
freopen("test.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
for_(i, 0, MXA+1) bc[i] = __builtin_popcount(i);
int n; cin >> n;
vi a(n), b(n);
for_(i, 0, n) cin >> a[n-i-1];
for_(i, 0, n) cin >> b[n-i-1];
int ans = 0, start = -1;
for (int i = n-1; i >= 0; i--) {
int temp = 0, suc = -1;
int h1 = a[i] >> 10, h2 = a[i] & MXH;
for_(v, 0, MXH+1) {
int k = h1 & v;
if (bc[k] > b[i]) continue;
if (temp < bestVal[k][h2][b[i]-bc[k]]) {
temp = bestVal[k][h2][b[i]-bc[k]];
suc = bestIdx[k][h2][b[i]-bc[k]];
}
}
temp += 1;
nxt[i] = suc;
if (temp > ans) {
ans = temp;
start = i;
}
for_(v, 0, MXH+1) {
int k = bc[h2 & v];
if (temp > bestVal[h1][v][k]) {
bestVal[h1][v][k] = temp;
bestIdx[h1][v][k] = i;
}
}
}
cout << ans << endl;
vi seq;
while (start != -1) {
seq.push_back(start);
start = nxt[start];
}
//cout << seq.size() << endl;
reverse(seq.begin(), seq.end());
for (int i: seq) cout << n-i << " ";
cout << endl;
return 0;
}
