/// wa
#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")
#include<bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1e2;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void fin() {
#ifdef AM
freopen(".in", "r", stdin);
#endif
}
const bool flag = 0;
const int N = 1e5+10;
int dp[N], p[N], pos[N], act[N];
void ma1n() {
int n;
cin >> n;
vector<int> a(n);
for (int& x : a) {
cin >> x;
}
vector<int> k(n);
for (int& x : k) {
cin >> x;
}
memset(p, -1, sizeof(p));
memset(pos, -1, sizeof(pos));
int cur = 0;
if (*max_element(all(a)) < (1<<8)) {
int ans = 0;
for (int i = 0; i < n; ++i) {
if (__builtin_popcount(a[i]) == k[i]) {
dp[a[i]]++;
if (dp[a[i]] > ans) {
ans = dp[a[i]], cur = i;
}
p[i] = pos[a[i]];
}
dp[a[i]] = max(1, dp[a[i]]);
for (int mask = 0; mask < (1<<8); ++mask) {
if (mask == a[i]) continue;
int cnt = __builtin_popcount(a[i]&mask);
if (cnt == k[i] && dp[mask]+1 > dp[a[i]]) {
dp[a[i]] = dp[mask]+1;
if (dp[a[i]] > ans) {
ans = dp[a[i]], cur = i;
}
p[i] = pos[mask];
}
}
if (act[pos[a[i]]] < dp[a[i]]) {
pos[a[i]] = i;
}
act[i] = dp[a[i]];
}
} else {
for (int i = 0; i < n; ++i) {
dp[i] = 1;
for (int j = 0; j < i; ++j) {
int cnt = __builtin_popcount(a[i]&a[j]);
if (cnt == k[i] && dp[i] < dp[j]+1) {
dp[i] = dp[j]+1, p[i] = j;
}
}
}
cur = max_element(dp, dp+N)-dp;
}
vector<int> ans;
while (~cur) {
ans.pb(cur);
cur = p[cur];
}
reverse(all(ans));
cout << sz(ans) << "\n";
for (int x : ans) cout << x+1 << " ";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr), fin();
int ts = 1;
if (flag) {
cin >> ts;
}
while (ts--) {
ma1n();
}
return 0;
}
