//#pragma GCC optomize ("Ofast")
//#pragma GCC optomize ("unroll-loops")
//#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz size
#define cl clear
#define ins insert
#define ers erase
#define pii pair < int , int >
#define pll pair< long long , long long >
#define all(x) x.begin() , x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define tostr(x) to_string(x)
#define tonum(s) atoi(s.c_str())
#define seon(x) setprecision(x)
#define bpop(x) __builtin_popcount(x)
#define deb(x) cerr << #x << " = " << x << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
const double PI = 3.14159265;
const ll N = 100+9 , M = 25800+9;
const ll mod = 1e9+7;
const ll inf = 1e9;
const ll INF = 1e18;
using namespace std;
int a[N] , k[N] , dp[N] , p[N];
void solve(){
int n;
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i] , p[i] = i;
for(int i = 1; i <= n; i++) cin >> k[i];
for(int i = 1; i <= n; i++){
for(int j = 1; j < i; j++){
if(bpop((a[i] & a[j])) == k[i]){
if(dp[i] < dp[j]+1){
p[i] = j;
dp[i] = dp[j] + 1;
}
}
}
}
int ans = 0 , x = 1;
for(int i = 1; i <= n; i++){
if(dp[i] > ans){
x = i;
ans = dp[i];
}
}
vector<int> v;
while(p[x] != x){
v.pb(x);
x = p[x];
}
v.pb(x);
reverse(all(v));
cout << v.sz() <<"\n";
for(int x : v) cout << x <<" ";
}
signed main(){
ios;
solve();
return 0;
}
/*
*/
