#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define PII pair<int,int>
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define rep(k,l,r) for(int k=l;k<=r;++k)
#define per(k,r,l) for(int k=r;k>=l;--k)
#define cl(f,x) memset(f,x,sizeof(f))
using namespace std;
void file_IO() {
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
}
const int N=10;
struct node {
	int x,y,val;
}; node t[N];
int n;
void update() {
	sort(t+1,t+n+1,[](const node &a,const node &b) {
		return a.val>b.val;	
	});
	int cnt=0;
	rep(i,1,n) {
		int c1=0,c2=0;
		rep(j,1,cnt) {
			if(t[i].x==t[j].x)
				++c1;
			if(t[i].y==t[j].y)
				++c2;
		}
		if(c1<=1&&c2<=1)
			t[++cnt]=t[i];
	}
	n=cnt;
}
void solve() {
	int q;
	scanf("%d",&q);
	int last=0;
	while(q--) {
		int op,x,y;
		scanf("%d%d%d",&op,&x,&y);
		x^=last; y^=last;
		if(op==1) {
			int val;
			scanf("%d",&val);
			val^=last;
			t[++n]={x,y,val};
			update();
		} else {
			int res=0;
			rep(i,1,n) {
				if(t[i].x!=x&&t[i].y!=y)
					chkmax(res,t[i].val);
			}
			printf("%d\n",last=res);
		}
	}
}
signed main() {
	//file_IO();
	int testcase=1;
	//scanf("%d",&testcase);
	while(testcase--)
		solve();
	return 0;
}