#include <bits/stdc++.h>
#define int long long
// #define B 180
using namespace std;

const int N = 1e6 + 10;
int n;
vector<pair<int, __int128_t>> vec;
// __int128_t 
__int128_t p[N];
__int128_t base2, base3;
int ans;

int getbit(__int128_t &x, int i) {
    int res = 0;
    res += x >> (2 * i) & 1;
    res += 2 * (x >> (2 * i + 1) & 1);
    return res;
}

__int128_t Xor(__int128_t &a, __int128_t &b) {
    __int128 v2 = (a & b & base2), v3 = ((a | b) & base3);
    return a + b - 3 * ((v2 >> 1) | ((v3 >> 1) & v3));
}

int insert(__int128_t x) {
    for (int i = 59; ~i; --i) {
        if (getbit(x, i) != 0) {
            if (!p[i]) {
                p[i] = x;
                return 1;
            }
            else {
                x = Xor(x, p[i]);
                if (getbit(x, i) != 0) x = Xor(x, p[i]);
            }
        }
    }
    return 0;
}


bool cmp(pair<int, __int128_t> a, pair<int, __int128_t> b) {
    return a.first > b.first;
}

__int128_t btot(int x) {
    __int128_t res = 0;
    for (int i = 0; i < 60; ++i) {
        if (x >> i & 1) {
            res |= (__int128_t)1 << (2 * i);
        }
    }
    return res;
}

void rebuild() {
    sort(vec.begin(), vec.end(), cmp);
    vector<pair<int, __int128_t>> res;
    ans = 0;
    // clear();
    for (int i = 59; ~i; --i) p[i] = 0;
    for (auto it : vec) {
        if (insert(it.second)) {
            ans += it.first;
            res.emplace_back(it.first, it.second);
        }
    }
    vec = res;
}

signed main() {
    for (int i = 0; i + 1 < 120; i += 2) base2 |= (__int128_t)1 << (2 * i), base3 |= (__int128_t)3 << (2 * i);

    scanf("%lld", &n);
    for (int i = 1; i <= n; ++i) {
        int x, y;
        scanf("%lld%lld", &x, &y);
        x = x ^ ans;
        int b = y ^ ans;
        __int128_t a = btot(x);
        vec.push_back(make_pair(b, a));
        rebuild();
        printf("%lld\n", ans);
    }
    return 0;
}