#include <bits/stdc++.h>

using namespace std;

#define vc vector
#define pii pair <int, int>
//#define int long long
using ld = long double;
using ll = long long;
const int inf = 1e9;


template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

typedef vector<short> koks;

koks operator*(koks a, short b) {
#pragma ivdep
    for (int i = 0; i < a.size(); ++i) a[i] *= b;
#pragma ivdep
    for (int i = 0; i < a.size(); ++i) a[i] %= 3;
    return a;
}
koks operator+(koks a, koks b) {
#pragma ivdep
    for (int i = 0; i < a.size(); ++i) a[i] += b[i];
#pragma ivdep
    for (int i = 0; i < a.size(); ++i) a[i] %= 3;
    return a;
}

void solve_case() {
    int n;
    cin >> n;
    long long ans = 0;
    vector<pair<koks, long long>> bas(60);
    for (auto &[x, y] : bas) x.resize(60);
    for (int i = 0; i < n; ++i) {
        long long a, b;
        cin >> a >> b;
        a ^= ans, b ^= ans;
        koks x;
        x.resize(60);
        for (int i = 0; i < 60; ++i) x[i] = a >> i & 1ll;
        for (int i = 0; i < bas.size(); ++i) {
            if (!x[i]) continue;
            if (!bas[i].second) {
                bas[i] = {x, b};
                break;
            } else {
                if (bas[i].second < b) swap(bas[i].first, x), swap(bas[i].second, b);
                if (x[i] == bas[i].first[i]) x = x * 2;
                x = x + bas[i].first;
            }
        }
        ans = 0;
        for (auto &[x, y] : bas) ans += y;
        cout << ans << '\n';
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    while (T--) solve_case();
}