#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=5e3+5,M=N*4+5,K=1000+5,mod=1e8+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n;
ll tot;
using info=array<char,60>;
info operator +(const info &A,const info &B){
	info C;
	for(int i=0;i<60;i++) C[i]=(A[i]+B[i])%3;
	return C;
}
info f[60];ll fw[60];
void ins(info x,ll w){
	for(int i=59;~i;i--) if(x[i]){
		if(fw[i]<w) tot+=w-fw[i],swap(w,fw[i]),swap(x,f[i]);
		while(x[i]) x=x+f[i];
	}
}
void Solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		ll x,y;scanf("%lld%lld",&x,&y);
		x^=tot;y^=tot;
		gdb(x,y);
		info w;
		for(int j=0;j<60;j++) w[j]=x>>j&1;
		ins(w,y);
		printf("%lld\n",tot);
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}