#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 100010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
x += k;
x %= mod;
if (x < 0)
x += mod;
}
void del(int &x, int k)
{
x -= k;
x %= mod;
if (x < 0)
x += mod;
}
pii f[1 << 11][1 << 11][11];
int n, a[maxn], trace[maxn], k[maxn], l[maxn], r[maxn];
int ans, pos;
main()
{
#define name "TASK"
if (fopen(name ".inp", "r"))
{
freopen(name ".inp", "r", stdin);
freopen(name ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
fo(i, 1, n)
{
cin >> a[i];
l[i] = a[i] >> 10;
r[i] = a[i] & ((1 << 11) - 1);
}
fo(i, 1, n) cin >> k[i];
fo(i, 1, n)
{
int best = 1, pp = 0;
fo(mask, 0, (1 << 11) - 1)
{
int need = k[i] - bitcount(mask & r[i]);
if (need < 0)
continue;
if (maximize(best, f[l[i]][mask][need].fi + 1))
pp = f[l[i]][mask][need].se;
}
trace[i] = pp;
if (maximize(ans, best))
pos = i;
fo(mask, 0, (1 << 11) - 1)
{
if (maximize(f[mask][r[i]][bitcount(mask & l[i])].fi, best))
f[mask][r[i]][bitcount(mask & l[i])].se = i;
}
}
cout << ans;
en;
vi res;
while (pos)
{
res.pb(pos);
pos = trace[pos];
}
reverse(all(res));
for (int it : res)
cout << it << ' ';
en;
}
