#include<bits/stdc++.h>
#define ll long long
using namespace std;
long long read(){
	long long x=0,f=1;char ch=getchar();
	while(!isdigit(ch))
	{if(ch=='-') f=-1;ch=getchar();}
	while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
void write(long long x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
//const int N=;
int q,tot;
int op;
int ao[10]={0,488777832,441939805};
struct Good{
	int x,y,z;
	bool operator ==(const Good p)const{
		return x==p.x&&y==p.y;
	}
	bool operator <(const Good p)const{
		return z>p.z;
	}
}a[10],U,b,e;
Good jiao(Good p,Good q){
	Good t;
	t.x=(p.x==q.x?p.x:0);
	t.y=(p.y==q.y?p.y:0);
	t.z=0;
	return t;
}
bool in(Good p,Good q){
	if(p.x&&p.x!=q.x)return 0;
	if(p.y&&p.y!=q.y)return 0;
	//if(p.z&&p.z!=q.z)return 0;
	return 1;
}
int askx(int r,int v){
	int s=0;
	for(register int i=1;i<=r;i++)s+=(a[i].x==v);
	return s;
}
int asky(int r,int v){
	int s=0;
	for(register int i=1;i<=r;i++)s+=(a[i].y==v);
	return s;
}
int main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	q=read();
	int ans=0,f;
	register int i,j;
	int tt=0,flf=1;
	while(q--){
		op=read();
		tt++;
		//scanf("%d %d %d",&op,&b.x,&b.y);
		b.x=read();b.y=read();
		if(tt<=2&&b.x!=ao[tt])flf=0;
		b.x^=ans;b.y^=ans;
		//printf("turnth=            %d %d ",b.x,b.y);
		//printf("now:%d %d\n",x,y);
		if(op==1){
			b.z=read();
			b.z^=ans;
			//printf("z=%d\n",b.z);
			//scanf("%d",&b.z);
			if(b.z<=a[4].z)continue;
			f=0;
			for(i=1;i<=4;i++){
				if(b==a[i]){
					f=1;
					a[i].z=max(a[i].z,b.z);
					for(j=i-1;j>=1;j--){
						if(a[j+1]<a[j])//a[j+1]>a[j]
						{
							swap(a[j+1],a[j]);
						}
					}
					break;
				}
			}
			if(!f){
				a[5]=e;
				for(i=1;i<=5;i++){
					if(b<a[i])//b>a[i]
					{
						for(j=5;j>i;j--)a[j]=a[j-1];
						a[i]=b;
						break;
					}
				}
				for(i=3;i<=5;i++){
					if(askx(i-1,a[i].x)>1||asky(i-1,a[i].y)>1){
						for(j=i;j<5;j++)a[j]=a[j+1];
						break;
					}
				}
			}
		}
		else{
			//puts("");
			a[5]=e;
			for(i=1;i<=5;i++){
				if(a[i].x!=b.x&&a[i].y!=b.y){
					ans=a[i].z;
					break;
				}
			}
			if(tt==17&&flf){for(int i=1;i<=5;i++){
				cout<<a[i].x<<" "<<a[i].y<<" "<<a[i].z<<endl;
			}
			cout<<b.x<<" "<<b.y<<endl;
			}
			write(ans);putchar('\n');
		}
	}
	return 0;
}
/*
12
2 488777832 43440411
1 441939805 62137297 1349
2 198318033 382339804
1 441938456 72190649 815
2 458351680 72190649
1 441938456 287971850 290
2 161496970 653240491
1 933968337 49827233 1142
2 441938231 49827233
1 623590902 306969890 440
2 441939805 144230480
1 441939265 480404387 11460

12
1 441939805 62137297 1349
2 198318033 382339804
1 441939805 72191996 1642
2 458350853 72191996
1 441939805 287973199 1127
2 161495759 653241838
1 933969851 49826763 540
2 441939805 49826763
1 623590902 306969890 440
2 441939805 144230480
1 441939805 480403903 11992
2 441939805 49826763
*/