#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define int long long
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

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

    int n;
    cin >> n;
    int last = 0;
    vector<int> mx(3);
    int mx1 = 0;
    map<int, int> lol;
//    vector<set<pair<int, int>>> mxx(3);
//    mxx[0].insert({0, -1});
//    mxx[1].insert({0, -1});
//    mxx[2].insert({0, -1});
set<pair<int, int>> mxx;
    for (int i = 0; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        a ^= last;
        b ^= last;
        if (mxx.find({lol[a], a}) != mxx.end()) mxx.erase(mxx.find({lol[a], a}));
        lol[a] = max(lol[a], b);
        mxx.insert({lol[a], a});
        if (mxx.size() > 7) {
            mxx.erase(mxx.begin());
        }
        for (auto e : mxx) {
            last = max(last, e.first);
        }
        for (auto e : mxx) {
            for (auto j : mxx) {
                if (j.first <= e.first) continue;
                last = max(last, e.first + j.first);
            }
        }
        for (auto e : mxx) {
            for (auto j : mxx) {
                if (j.first <= e.first) continue;
                for (auto k : mxx) {
                    if (k.first <= j.first) continue;
                    if ((e.second == 1 || k.second == 1 || j.second == 1) && (e.second ^ j.second ^ k.second) == 0) continue;
                    last = max(last, e.first + j.first + k.first);
                }
            }
        }
        cout << last << '\n';
    }
}