#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();
	}
}

__int128_t xor3(__int128_t a, __int128_t b) {
	__int128_t res = 0, i3 = 1;
	while (a || b) {
		res += (((a % 3) + (b % 3)) % 3) * i3;
		i3 *= 3;
		a /= 3;
		b /= 3;
	}
	return res;
}

__int128_t mndeg3(__int128_t x) {
	__int128_t i3 = 1;
	while (i3 * 3 <= x) {
		i3 *= 3;
	}
	return i3;
}

void solve() {
	int n;
	cin >> n;
	ll last = 0;
	vector<pair<__int128_t, int>> base;
	for (int i = 0; i < n; i++) {
		ll x, y;
		cin >> x >> y;
		x ^= last;
		y ^= last;
		__int128_t i3 = 1;
		__int128_t a = 0;
		for (int j = 0; j < 60; j++) {
			if ((1ll << j) & x) {
				a += i3;
			}
			i3 *= 3;
		}
		int b = y;
		int ind = 0;
		pair<int, int> mx = {0, 0};
		pair<__int128_t, int> oink;
		for (auto [v, c] : base) {
			if (mndeg3(a) == mndeg3(v)) {
				if (make_pair(b - c, ind) > mx) {
					mx = make_pair(b - c, ind);
					oink = {a, b};
				}
				while (a >= mndeg3(v)) {
					a = xor3(a, v);
				}
			} else {
				break;
			}
			ind++;
		}
		if (a) {
			base.emplace(base.begin() + ind, a, b);
			last += b;
		} else if (mx.first > 0) {
			last += mx.first;
			base[mx.second] = oink;
		}
		cout << last << '\n';
	}
}