// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
refs:
https://github.com/quangloc99/CompetitiveProgramming/blob/master/olympiad/IZhO/2017/subsequence.cpp
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
pii best[1 << 10][1 << 10][10];
void solve(int test_case)
{
int n; cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
vector<int> dp(n, 1), par(n, -1);
memset(best, -1, sizeof best);
rep(i, n) {
int i_first_half = 0, i_second_half = 0;
rep(bit, 20) {
int f = 1 << bit;
if (a[i] & f) {
if (bit < 10) {
i_first_half |= f;
}
else {
i_second_half |= (f >> 10);
}
}
}
rep(j_first_half, 1 << 10) {
int sb = setbits(i_first_half & j_first_half);
int want = b[i] - sb;
if (want < 0 or want > 10) conts;
auto [val, j] = best[j_first_half][i_second_half][want];
val++;
if (val > dp[i]) {
dp[i] = val;
par[i] = j;
}
}
rep(j_second_half, 1 << 10) {
int sb = setbits(i_second_half & j_second_half);
if (dp[i] > best[i_first_half][j_second_half][sb].ff) {
best[i_first_half][j_second_half][sb] = {dp[i], i};
}
}
}
int mx = -1, ptr = -1;
rep(i, n) {
if (dp[i] > mx) {
mx = dp[i];
ptr = i;
}
}
cout << mx << endl;
vector<int> ans;
while (ptr != -1) {
ans.pb(ptr);
ptr = par[ptr];
}
reverse(all(ans));
trav(x, ans) cout << x + 1 << " ";
cout << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
