#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
const int MAXN = 1e5 + 7;
int a[MAXN];
int k[MAXN];
int n;
void solve1(){
int ans = 1;
vi dp(n + 1, 0);
vi lst(n + 1, -1);
for(int i = 1; i <= n; i++){
dp[i] = 1;
for(int j = 1; j < i; j++){
if(__builtin_popcount(a[i] & a[j]) == k[i]){
if(dp[j] + 1 > dp[i]){
lst[i] = j;
}
dp[i] = max(dp[j] + 1, dp[i]);
}
}
ans = max(ans, dp[i]);
}
cout << ans << '\n';
for(int i = 1; i <= n; i++){
if(dp[i] == ans){
vi res;
int v = i;
while(v != -1){
res.pb(v);
v = lst[v];
}
reverse(all(res));
for(auto ele : res){
cout << ele << ' ';
}
cout << '\n';
return;
}
}
}
void solve2(){
vector<pii> dp((1 << 8) + 7, mp(0, -1));
vi lst(n + 1, -1);
int ans = 0;
for(int i = 1; i <= n; i++){
if(dp[a[i]].fi > 0){
if(__builtin_popcount(a[i]) == k[i]){
lst[i] = dp[a[i]].se;
dp[a[i]].fi++;
dp[a[i]].se = i;
}
}else{
dp[a[i]].fi = 1;
dp[a[i]].se = i;
}
for(int j = 0; j < (1 << 8); j++){
if(j == a[i]){
continue;
}
if(__builtin_popcount(j & a[i]) == k[i]){
if(dp[j].fi + 1 > dp[a[i]].fi){
lst[i] = dp[j].se;
dp[a[i]].fi = dp[j].fi + 1;
}
}
}
}
cout << ans << '\n';
for(int i = 0; i < (1 << 8); i++){
if(dp[i].fi == ans){
vi res;
int v = dp[i].se;
while(v != -1){
res.pb(v);
v = lst[v];
}
reverse(all(res));
for(auto ele : res){
cout << ele << ' ';
}
cout << '\n';
return;
}
}
}
void solve(){
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){
solve1();
}else{
solve2();
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
//freopen("subsequence.in", "r", stdin);
//freopen("subsequence.out", "w", stdout);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
