// In the Name of God
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(a) int(a.size())
#define all(v) v.begin(), v.end()
#define bpc(v) __builtin_popcountll(v)
#define itr iterator
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define per(i, a, b) for (int i = b; i >= a; --i)
#define ub upper_bound
#define lb lower_bound
const int N = 1e5 + 5;
const int mod = 1e8 + 7;
const int inf = 1e9 + 1;
const double eps = 1e-15;
const int pw = 257;
int n, a[N], k[N], dp[N], id, p[N];
vector<int> ans;
int main() {
#ifdef Madi
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
ios_base :: sync_with_stdio(false); cin.tie(NULL);
cin >> n;
rep(i, 1, n)
cin >> a[i];
rep(i, 1, n)
cin >> k[i];
rep(i, 1, n) {
dp[i] = 1;
rep(j, 1, i - 1)
if (bpc(a[i] & a[j]) == k[i] && dp[j] >= dp[i])
p[i] = j, dp[i] = dp[j] + 1;
if (dp[i] > dp[id])
id = i;
}
while (id >= 1) {
ans.pb(id);
id = p[id];
}
cout << sz(ans) << "\n";
per(i, 0, sz(ans) - 1)
cout << ans[i] << ' ';
#ifdef Madi
cerr << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
