// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v) memset(h, v, sizeof h)
#define Forv(i, a) for(auto& i : a)
#define For(i, a, b) for(int i = a; i <= b; ++i)
#define Ford(i, a, b) for(int i = a; i >= b; --i)
#define c_bit(i) __builtin_popcountll(i)
#define Bit(mask, i) ((mask >> i) & 1LL)
#define onbit(mask, i) ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
using namespace std;
namespace std {
template <typename T, int D>
struct _vector : public vector <_vector <T, D - 1>> {
static_assert(D >= 1, "Dimension must be positive!");
template <typename... Args>
_vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
};
template <typename T> struct _vector <T, 1> : public vector <T> {
_vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
};
template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = (1 << 20) + 5;
const ll mod = 1e9 + 7;
const ll oo = 1e18;
//#define int long long
int n, a[MAXN], b[MAXN];
ll dp[MAXN];
int trace[MAXN];
set<int> List[MAXN];
void Solve() {
cin >> n;
For(i, 1, n) cin >> a[i], List[a[i]].insert(i);
For(i, 1, n) cin >> b[i];
if(n >= 5000)
For(i, 0, LOG) For(s, 0, (1 << LOG) - 1){
if(Bit(s, i)){
Forv(x, List[s]) List[s ^ (1 << i)].insert(x);
}
}
For(i, 1, n) {
maximize(dp[i], 1LL);
if(i <= 5000)
For(j, 1, i - 1){
if(c_bit(a[i] & a[j]) == b[i]){
if(maximize(dp[i], dp[j] + 1)) trace[i] = j;
}
}
else {
int s = a[i];
for(; s; s = (s - 1) & a[i]){
if(c_bit(s & a[i]) == b[i])
Forv(j, List[s]) {
if(j >= i) break;
if(c_bit(a[j] & a[i]) == b[i])
if(maximize(dp[i], dp[j] + 1)){
trace[i] = j;
}
}
}
if(b[i] == 0)
Forv(j, List[0]) {
if(j >= i) break;
if(c_bit(a[j] & a[i]) == b[i])
if(maximize(dp[i], dp[j] + 1)){
trace[i] = j;
}
}
}
}
ll ans = 0, ed;
For(i, 1, n) if(maximize(ans, dp[i])) ed = i;
cout << ans << '\n';
vector<int> cc;
while(ed){
cc.push_back(ed);
ed = trace[ed];
}
reverse(all(cc));
Forv(x, cc) cout << x << ' ';
}
int32_t main() {
cin.tie(0) -> sync_with_stdio(0);
if(fopen("IZhO17_subsequence.inp", "r")) {
freopen("IZhO17_subsequence.inp", "r", stdin);
freopen("IZhO17_subsequence.out", "w", stdout);
}
int t = 1;
// cin >> t;
for (int test = 1; test <= t; test++) {
Solve();
}
return 0;
}
