#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

const int LG = 60;
const long long INF = 1E18 + 7;

int n;
long long x, y, mi, ans = 0;
long long nb[3];

struct element {
    int val;
    long long bit[3];

    element(int _val, long long _bit) : val(_val) {
        bit[1] = _bit;
        bit[0] = ((1LL << LG) - 1) ^ _bit;
        bit[2] = 0;
    }

    int sig() const {
        return (bit[1] == 0 && bit[2] == 0 ? -1 : __lg(bit[1] | bit[2]));
    }

    bool test(int u) {
        return !(bit[0] >> u & 1);
    }

    inline void operator^=(const element &oth) {
        if ((bit[1] ^ oth.bit[1]) >> oth.sig() & 1) {
            swap(bit[1], bit[2]);
        }
        nb[0] = (bit[0] & oth.bit[0]) | (bit[1] & oth.bit[1]) | (bit[2] & oth.bit[2]);
        nb[1] = (bit[0] & oth.bit[2]) | (bit[1] & oth.bit[0]) | (bit[2] & oth.bit[1]);
        nb[2] = (bit[0] & oth.bit[1]) | (bit[1] & oth.bit[2]) | (bit[2] & oth.bit[0]);
        bit[0] = nb[0]; bit[1] = nb[1]; bit[2] = nb[2];
    }
};
vector<element> ve;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    while (n--) {
        cin >> x >> y;
        x ^= ans; y ^= ans;
        element cur = element(y, x);
        int mi = -1;
        for (int i = 0; i < ve.size(); i++) {
            element &v = ve[i];
            if (cur.test(v.sig())) {
                if (mi == -1 || ve[mi].val > v.val) {
                    mi = i;
                }
                cur ^= v;
            }
        }
        if (cur.sig() == -1 && ve[mi].val < cur.val) {
            ans += cur.val - ve[mi].val;
            ve[mi].val = cur.val;
        } else if (cur.sig() >= 0) {
            ans += y;
            ve.push_back(cur);
            for (int i = ve.size() - 1; i > 0; i--) {
                if (ve[i].bit[0] < ve[i - 1].bit[0]) {
                    swap(ve[i], ve[i - 1]);
                } else {
                    break;
                }
            }
        }
        cout << ans << '\n';
    }
}