#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

vector<int> operator+(vector<int> a, vector<int> b) {
    vector<int> c;
    set_symmetric_difference(a.begin(), a.end(), b.begin(), b.end(), back_inserter(c));
    return c;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n;
        cin >> n;

        vector<i64> a(n), b(n);
        i64 A = 0, B = 0;
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            A ^= a[i];
        }
        for (int i = 0; i < n; i++) {
            cin >> b[i];
            B ^= b[i];
        }

        constexpr int L = 60;
        vector<i64> basis(L);
        vector<vector<int>> at(L);

        for (int i = 0; i < n; i++) {
            i64 x = a[i] ^ b[i];
            for (int j = L - 1; j >= 0; j--) {
                if (x >> j & 1) {
                    if (basis[j] == 0) {
                        basis[j] = x;
                        at[j] = {i};
                    }
                    x ^= basis[j];
                    at[j] = at[j] + vector{i};
                }
            }
        }

        vector<int> swaps;

        for (int bit = L - 1; bit >= 0; bit--) {
            if (A >> bit & 1 && B >> bit & 1) {
                continue;
            } else if (A >> bit & 1 || B >> bit & 1) {
                i64 x = basis[bit] & ~(1LL << bit);
                auto v = at[bit];
                for (int j = bit - 1; j >= 0; j--) {
                    if (x >> j & 1) {
                        if (basis[j] == 0) {
                            basis[j] = x;
                            at[j] = v;
                        }
                        x ^= basis[j];
                        v = v + at[j];
                    }
                }
            } else {
                if (basis[bit] != 0) {
                    A ^= basis[bit], B ^= basis[bit];
                    swaps = swaps + at[bit];
                }
            }
        }

        cout << A + B << ' ' << swaps.size() << '\n';
        for (auto i : swaps) {
            cout << i + 1 << " \n"[i == swaps.back()];
        }
    };
    
    solve();
    
    return 0;
}