#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e5 + 5;
int n;
ll a[N], b[N], xr, xr2;
struct gauss {
	vector<pair<ll, int>> setOfXors;
	void ins(ll x, int i) {	///Add X to Gaussian Basis
		for (auto v : setOfXors)
			x = min(x, x ^ v.first);
		if(x)
			setOfXors.push_back({x, i});
	}
	pair<ll, vector<int>> qry(ll x) { ///Get maximum subsequence XOR ^ x
		vector<int> ret;
		for (auto v : setOfXors) {
			if(x ^ v.first > x) {
				x ^= v.first;
				ret.push_back(v.second);
			}
		}
		return {x, ret};
	}
};
int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    gauss G;
    cin >> n;
    for(int i = 1;i <= n;i++) {
		cin >> a[i];
		xr ^= a[i];
		xr2 ^= a[i];
	}
	for(int i = 1;i <= n;i++) {
		cin >> b[i];
		xr2 ^= b[i];
		G.ins(a[i] ^ b[i], i);
	}
	auto ret = G.qry(xr);
	cout << ret.first + (xr2 ^ ret.first) << " " << ret.second.size() << '\n';
	for(auto i : ret.second)
		cout << i << " ";
	cout << endl;
    return 0;
}
// xr = xor of all a
// xr2 = xor of all a and b
// c_i = a_i ^ b_i
// query of(xr) = maximum xor for a with the needed swaps
// ans = query of(xr) + (xr2 ^ query of(xr))