#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define gcd __gcd
#define sz(v) (int) v.size()
#define pb push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define compact(v) (v).erase(unique(all(v)), (v).end())
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define ROF(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) "[" #x " = " << (x) << "]"
///#define int long long
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template<typename T> bool ckmx(T& a, const T& b){if(a < b) return a = b, true; return false;}
template<typename T> bool ckmn(T& a, const T& b){if(a > b) return a = b, true; return false;}
const int N = 2e5+5;
const ll MOD = 1e9+7;
const ll INF = 1e18;
void solve()
{
int n; cin >> n;
vector<int> a(n + 1), k(n + 1);
FOR(i, 1, n) cin >> a[i];
FOR(i, 1, n) cin >> k[i];
int Mx = 31 - __builtin_clz(*max_element(1 + all(a))) + 1, ans = 0;
const int B = (Mx / 2) + (Mx & 1);
vector<vector<vector<int>>> dp((1 << B), vector<vector<int>>((1 << B), vector<int>(B + 1, 0)));
vector<vector<vector<int>>> ss((1 << B), vector<vector<int>>((1 << B), vector<int>(B + 1, 0)));
vector<int> trace(n + 1, 0);
FOR(i, 1, n){
int cur_dp = 1;
int head = (a[i] >> B), tail = (a[i] & ((1 << B) - 1));
FOR(mask, 0, (1 << B) - 1){
int needB = k[i] - __builtin_popcount(mask & head);
if(needB < 0 || needB > B) continue;
if(ckmx(cur_dp, dp[mask][tail][needB] + 1)){
trace[i] = ss[mask][tail][needB];
}
}
FOR(mask, 0, (1 << B) - 1){
int has = __builtin_popcount(mask & tail);
if(ckmx(dp[head][mask][has], cur_dp)){
ss[head][mask][has] = i;
}
}
if(ckmx(ans, cur_dp)){
Mx = i;
}
}
cout << ans << "\n";
stack<int> st; while(Mx) st.push(Mx), Mx = trace[Mx];
while(sz(st)) cout << st.top() <<" ", st.pop();
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define name "InvMOD"
if(fopen(name".INP", "r")){
freopen(name".INP","r",stdin);
freopen(name".OUT","w",stdout);
}
int t = 1; //cin >> t;
while(t--) solve();
return 0;
}
