#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;
void solve(){
ll n, i, j, ans, k, x, res=0, best=-1, prev;
cin>>n;
vector<ll> a(n);
vector<ll> b(n);
vector<vector<vector<ll>>> dp((1<<10), vector<vector<ll>>((1<<10), vector<ll>(11)));
vector<vector<vector<ll>>> last((1<<10), vector<vector<ll>>((1<<10), vector<ll>(11, -1)));
vector<ll> back(n);
for(i=0;i<n;++i){
cin>>a[i];
}
for(i=0;i<n;++i){
cin>>b[i];
}
for(i=0;i<n;++i){
ans = 0;
prev = -1;
for(j=0;j<(1<<10);++j){
k = b[i];
k -= __builtin_popcountll(a[i]&(j<<10));
if(k < 0 or k > 10) continue;
x = a[i]&((1<<10)-1);
if(ans < dp[j][x][k]){
ans = dp[j][x][k];
prev = last[j][x][k];
}
}
back[i] = prev;
++ans;
x = a[i]&(((1<<10)-1)<<10);
for(j=0;j<(1<<10);++j){
k = __builtin_popcountll(a[i]&j);
if(k > 10) continue;
if(dp[x][j][k] < ans){
dp[x][j][k] = ans;
last[x][j][k] = i;
}
}
if(res < ans){
res = ans;
best = i;
}
}
vector<ll> c;
while(best != -1){
c.pb(best);
best = back[best];
}
cout<<res<<endl;
reverse(c);
for(auto el: c){
cout<<el+1<<' ';
}
cout<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
srand(time(nullptr));
ll t=1;
// cin>>t;
for(;t>0;--t){
solve();
}
return 0;
}
