#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
template<typename T>inline void read(T &x){
    x=0;
    char ch=getchar();
    bool flag=0;
    while(ch>'9'||ch<'0') flag=flag||ch=='-',ch=getchar();
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    x=flag?-x:x;
}
template<typename T,typename ...Args>inline void read(T &x,Args &...args){
    read(x),read(args...);
}
template<typename T>inline void prt(T x){
    if(x>9) prt(x/10);
    putchar(x%10+'0');
}
template<typename T>inline void put(T x){
    if(x<0) putchar('-'),x=-x;
    prt(x);
}
template<typename T>inline void put(char ch,T x){
    put(x),putchar(ch);
}
template<typename T,typename ...Args>inline void put(char ch,T x,Args ...args){
    put(ch,x),put(ch,args...);
}
#define N 15
int q,n;
struct node{
	int x,y,w;
	inline bool operator<(const node &b)const{
		return w>b.w;
	}
}t[N],p[N];
inline void modify(){
	sort(t+1,t+n+1);
	int state=0,x=0,y=0,u=0,v=0,m=0;
	for(int i=1;i<=n;i++){
		if(!state) state=1,x=t[i].x,y=t[i].y,p[++m]=t[i];
		else if(state==1){
			if(t[i].x==x&&t[i].y==y) continue;
			if(t[i].x==x) state=2;
			else if(t[i].y==y) state=3;
			else state=4,u=t[i].x,v=t[i].y;
			p[++m]=t[i];
		}else if(state==2){
			if(t[i].x!=x) state=5,y=t[i].y,p[++m]=t[i];
		}else if(state==3){
			if(t[i].y!=y) state=5,x=t[i].x,p[++m]=t[i];
		}else if(state==4){
			int a=t[i].x!=x&&t[i].y!=y,b=t[i].x!=u&&t[i].y!=v;
			if(!a&&!b) continue;
			if(a&&b) state=6;
			else if(a) state=5,x=u,y=v;
			else if(b) state=5;
			p[++m]=t[i];
		}else if(state==5){
			if(t[i].x!=x&&t[i].y!=y) p[++m]=t[i],state=6;
		}
	}
	n=m;
	for(int i=1;i<=n;i++) t[i]=p[i];
}
int main(){
	read(q);
	for(int T=1,x,y,w,op,ans=0;T<=q;T++){
		read(op,x,y),x^=ans,y^=ans;
		if(op==1){
			read(w),w^=ans;
			t[++n]=(node){x,y,w};
			modify();
		}else{
			ans=0;
			for(int i=1;i<=n;i++){
				if(t[i].x!=x&&t[i].y!=y){
					ans=t[i].w;
					break;
				}
			}
			put('\n',ans);
		}
	}
	return 0;
}