#include <bits/stdc++.h>
using namespace std;
const int N=1e5+1;
int a[N],k[N];
int dp[N];
const int M=(1<<8)+1;
int mx[M],bk[M],bki[N];
int main()
{
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
cin>>k[i];
}
if(n<=5000)
{
for(int i=1;i<=n;i++)
{
dp[i]=1;
bki[i]=-1;
for(int j=1;j<i;j++)
{
if(dp[j]+1>dp[i] and __builtin_popcountll(a[i]&a[j])==k[i])
{
dp[i]=dp[j]+1;
bki[i]=j;
}
}
}
}else{
for(int i=1;i<=n;i++)
{
dp[i]=1;
bki[i]=-1;
for(int j=0;j<M;j++)
{
int pc = __builtin_popcount(a[i]&j); // computing bitcount
if(pc!=k[i])continue;
// cout<<"for "<<i<<' '<<j<<' '<<a[i]<<' '<<pc<<endl;
if(mx[j]+1 >= dp[i]) // updating mx
{
dp[i]=mx[j]+1;
bki[i]=bk[j];
}
}
if(dp[i]>mx[a[i]])
{
mx[a[i]]=dp[i];
bk[a[i]]=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=bki[k];
}
while(cur.size()){cout<<cur.back()<<' ';cur.pop_back();}
cout<<endl;
return 0;
}
