///Enta etfsh5t nseet el rank

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
        tree_order_statistics_node_update>;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
//#define mp(x, y) make_pair(x, y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ull = unsigned long long;
using uint = uint32_t;
using ii = pair<int, int>;

const int N = 3e6 + 6, A = 26, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-9;
const ll INF = 1e15;
int val = 0;
vector<tuple<int, int, bitset<64>>> vec;

void ins(int x, int i) {
    bitset<64> bt2;
    for (auto [v, i, bt]: vec) {
        if ((v ^ x) < x) {
            bt2 ^= bt;
            x ^= v;
        }
    }

    if (x) {
        bt2[vec.size()] = 1;
        vec.push_back({x, i, bt2});
    }
}

void doWork() {

    int n;
    cin >> n;
    vector<int> a(n), b(n);
    f(i, 0, n) {
        cin >> a[i];
        val ^= a[i];
    }
    f(i, 0, n) {
        cin >> b[i];
        val ^= b[i];
    }
    f(i, 0, n) {
        a[i] ^= (a[i] & val);
        b[i] ^= (b[i] & val);
        ins(a[i] ^ b[i], i);
    }
    int ans = 0;
    bitset<64> res;
    for (auto [v, i, bt]: vec) {
        if ((ans ^ v) > ans) {
            res ^= bt;
            ans ^= v;
        }
    }
    cout << ans * 2 + val << ' ' << res.count() << '\n';
    f(i, 0, 64) if (res[i])cout << get<1>(vec[i]) + 1 << ' ';
}


int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--)
        doWork();

    return 0;
}