/* * Author: Nonoze * Created: Saturday 24/01/2026 */ #include <bits/stdc++.h> using namespace std; #ifndef DEBUG #define dbg(...) #endif // #define cout cerr << "OUT: " #define endl '\n' #define endlfl '\n' << flush #define quit(x) return (void)(cout << x << endl) template<typename T> void read(T& x) { cin >> x; } template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); } template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); } template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); } template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); } template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); } template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; } #define sz(x) (int)(x.size()) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end()) #define pb push_back #define mp(a, b) make_pair(a, b) #define fi first #define se second #define cmin(a, b) a = min(a, b) #define cmax(a, b) a = max(a, b) #define YES cout << "YES" << endl #define NO cout << "NO" << endl #define QYES quit("YES") #define QNO quit("NO") // #define int long long #define double long double const int inf = numeric_limits<int>::max() / 4; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 1e9+7, LOG=20; void solve(); signed main() { ios::sync_with_stdio(0); cin.tie(0); int tt=1; // cin >> tt; while(tt--) solve(); return 0; } const int B=10; struct item { int x, prev; } dp[1<<B][1<<B][B+1]; int n, k, m, q; vector<int> a, b; void solve() { read(n); a.clear(), a.resize(n); read(a); b.clear(), b.resize(n); read(b); // item dp[1<<B][1<<B][B+1]; vector<int> pre(n, -1); int best=0, pos=0; for (int i=0; i<n; i++) { int x=a[i], ans=0; int fi=x%(1<<10), se=x>>10; for (int mask=0; mask<(1<<10); mask++) { int nb=__builtin_popcount(mask&se); if (nb<=b[i] && dp[fi][mask][b[i]-nb].x>ans) { ans=dp[fi][mask][b[i]-nb].x; pre[i]=dp[fi][mask][b[i]-nb].prev; } } ans++; for (int mask=0; mask<(1<<10); mask++) { int nb=__builtin_popcount(mask&fi); if (ans>dp[mask][se][nb].x) { dp[mask][se][nb].x=ans; dp[mask][se][nb].prev=i; } } if (ans>best) { best=ans; pos=i; } } cout << best << endl; vector<int> ans; while(pos!=-1) { ans.pb(pos+1); pos=pre[pos]; } reverse(all(ans)); cout << sz(ans) << endl; print(ans); }