#include<bits/stdc++.h>
using namespace std;
#ifdef ONPC
#include"debug.h"
#else
#define debug(...) 42
#endif
#define endl '\n'
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
const int mod = 1e9 + 7;
const int MAXN = 1e5 + 15;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
int dp[1025][1025][21], n, a[MAXN], b[MAXN];
int pos[1025][1025][21];
int prv[MAXN];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
memset(prv, -1, sizeof(prv));
pii best = {0, 0};
for (int i = 0; i < n; i++){
int lhs = a[i] % (1 << 10);
assert(lhs < 1024);
int opt = 0;
for (int j = 0; j < 1024; j++){
if (b[i] - __popcount(j&a[i]) >= 0 && ckmax(opt, dp[j][lhs][b[i] - __popcount(j&lhs)])){
prv[i] = pos[j][lhs][b[i] - __popcount(j&lhs)];
}
}
int rhs = (a[i] >> 10);
assert(rhs < 1024);
for (int j = 0; j < 1024; j++){
if (ckmax(dp[rhs][j][__popcount(j&rhs)], opt + 1)){
pos[rhs][j][__popcount(j&rhs)] = i;
}
}
ckmax(best, {opt + 1, i});
}
vector<int> ans;
for (int i = best.S; i != -1; ans.pb(i), i = prv[i]);
reverse(all(ans));
cout << sz(ans) << endl;
for (auto it : ans) cout << it + 1 << ' ';
}
