//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree <pair <int, int>, null_type, less <pair <int, int> >, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
#define ll long long
#define db double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define size(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define low_b lower_bound
#define endl "\n"
//#define int long long
using namespace std;
void dout() {
cerr << endl;
}
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
cerr << H << ' ';
dout(T...);
}
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair <int, int> pii;
const int N = 1e5 + 3, K = (1 << 8);
int n, a[N], k[N], dp[N], mx[K], p[N];
bool ok = true;
int getmx(int x, int y) {
if (x == -1) {
return y;
}
if (y == -1) {
return x;
}
if (dp[x] > dp[y]) {
return x;
}
return y;
}
vector <int> vec;
void getans(int x) {
if (x == -1) {
return;
}
vec.pb(x);
getans(p[x]);
}
void solve(int tc) {
// check for (int i = 0; i < n; j++)
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] >= (1 << 8)) {
ok = false;
}
}
for (int i = 1; i <= n; i++) {
cin >> k[i];
}
memset(mx, -1, sizeof(mx));
for (int i = 1; i <= n; i++) {
int res = -1;
if (ok) {
for (int j = 0; j < (1 << 8); j++) {
if (__builtin_popcount(a[i] & j) == k[i]) {
res = getmx(res, mx[j]);
}
}
} else {
for (int j = 1; j < i; j++) {
if (__builtin_popcount(a[i] & a[j]) == k[i]) {
res = getmx(res, j);
}
}
}
if (res != -1) {
dp[i] = dp[res];
}
p[i] = res;
dp[i]++;
if (ok) {
mx[a[i]] = getmx(mx[a[i]], i);
}
}
int ans = -1;
for (int i = 1; i <= n; i++) {
ans = getmx(ans, i);
}
cout << dp[ans] << endl;
getans(ans);
reverse(all(vec));
for (auto i : vec) {
cout << i << " ";
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int tc = 1;
// cin >> tc;
for (int i = 0; i < tc; i++) {
solve(i);
// cleanup();
}
}
