#include <bits/stdc++.h>

using namespace std;

using ll = long long;

void solve();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

pair<ll, ll> __xor(pair<ll, ll> a, ll b) {
    pair<ll, ll> res;
    res.first |= (a.first & ~a.second) & ~b;
    res.first |= ~a.second & b;
    res.second |= (a.first & ~a.second) & b;
    res.second |= a.second & ~b;
    res.first |= res.second;
    return res;
}

pair<ll, ll> _xor(pair<ll, ll> a, pair<ll, ll> b) {
    return __xor(__xor(a, b.first), b.second);
}

using num = pair<ll, ll>;

num norm(num& x) {
    num res;
    res.first = x.first | x.second;
    res.second = x.first & x.second;
    return res;
}

void solve() {
    int n;
    cin >> n;
    ll last = 0;
    array<pair<num, ll>, 60> base;
    base.fill({{0, 0}, 0});
    for (int i = 0; i < n; i++) {
        ll x, y;
        cin >> x >> y;
        x ^= last;
        y ^= last;
        num a = {x, 0};
        ll b = y;
        pair<ll, int> mx = {0, 0};
        pair<num, int> oink;
        for (int j = 59; j >= 0; --j) {
            if (!base[j].first.first) continue;
            auto [v, c] = base[j];
            if (a.first >> j & 1) {
                if (make_pair(b - c, j) > mx) {
                    mx = make_pair(b - c, j);
                    oink = {a, b};
                }
                while (a.first >> j & 1) {
                    a = _xor(a, v);
                }
            } else {
                break;
            }
        }
        if (a.first) {
            base[63 - __builtin_clzll(a.first)] = {a, b};
            last += b;
        } else if (mx.first > 0) {
            last += mx.first;
            base[mx.second] = oink;
        }
        cout << last << '\n';
    }
}