#include <bits/stdc++.h>
using namespace std;
const int N=1e5;
int a[N],k[N];
int dp[N];
const int M=1e6+1e5;
int mx[M][22],bk[M][22];
int main()
{
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n;
cin>>n;
int mx2=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
mx2=max(mx2,a[i]);
}
for(int i=1;i<=n;i++)
{
cin>>k[i];
}
for(int i=1;i<=n;i++)
{
// mx[mask][k] = max value of dp[i] such that popcount(mask & a[i]) = k
dp[i]=mx[a[i]][k[i]]+1;
bk[i][21]=bk[a[i]][k[i]];
if(n<mx2)
{
for(int q=1;q<=n;q++)
{
int j=a[q];
int pc = __builtin_popcount(a[i]&j);
if(dp[i]>mx[j][pc])
{
mx[j][pc]=dp[i];
bk[j][pc]=i;
}
}
continue;
}
for(int j=0;j<=mx2;j++)
{
int pc = __builtin_popcount(a[i]&j);
if(dp[i]>mx[j][pc])
{
mx[j][pc]=dp[i];
bk[j][pc]=i;
}
}
}
int k=max_element(dp+1,dp+n+1)-dp;
cout<<dp[k]<<endl;
vector<int> cur;
while(k>0)
{
cur.push_back(k);
k=bk[k][21];
}
while(cur.size()){cout<<cur.back()<<' ';cur.pop_back();}
cout<<endl;
return 0;
}
