#include<bits/stdc++.h>
#include<bits/extc++.h>
#define F(i,j,k) for(auto i=j;i<=(decltype(j))(k);i++)
#define exec(...) [&](){__VA_ARGS__}()
#define view(x) begin(x),end(x)
#define pb push_back
#define lambda [&]
#define x first
#define y second
#define endl '\n'
#define os ostream
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
template<typename T>void ckmin(T& a,T b){(a>b)&&(a=b);}
template<typename T>void ckmax(T& a,T b){(a<b)&&(a=b);}

#ifdef DEBUG
template<typename ...T>os& operator<<(os& out,tuple<T...> x);

template<typename T1,typename T2>os& operator<<(os& out,pair<T1,T2> x){return out<<tuple(x);}
template<typename T,typename=decltype(T().begin()),typename=enable_if_t<!is_same_v<decay_t<T>,string>>>os& operator<<(os& out,T x){return out<<"{",exec(auto n=0u;for(auto i:x) out<<i<<(++n==x.size()?"":",");),out<<"}";}
template<typename ...T>os& operator<<(os& out,tuple<T...> x){return apply(lambda(T... xx){auto n=0u;out<<"{";((out<<xx<<(++n==sizeof...(T)?"":",")),...),out<<"}";},x),out;}
#define debug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<" = "<<tuple(__VA_ARGS__)<<endl
#else
#define debug(...) (void)0
#endif

const int maxn=305;

mt19937 gen(random_device{}());

struct DATA{
	pair<int,array<pair<int,int>,2>> mp[maxn];
	int cnt[maxn];
	gp_hash_table<int,int> table;
	void push(int x,int y,int val){
		table[x]++;
		int tot=0;
		F(i,0,maxn-1){
			if(mp[i].x==x){
				auto p=mp[i].y;
				if(y==p[0].x) ckmax(p[0].y,val);
				else if(y==p[1].x) ckmax(p[1].y,val);
				else p[1]={y,val};
				if(p[0].y<p[1].y) swap(p[0],p[1]);
				mp[i].y=p;
				cnt[i]++;
				return;
			}
			if(!mp[i].x) return cnt[i]++,mp[i].x=x,mp[i].y[0]={y,val},debug(i,mp[i]),(void)0;
			tot+=cnt[i];
		}
		int pos=gen()%tot;
		F(i,0,maxn-1){
			pos-=cnt[i];
			if(pos<=0){
				mp[i].x=x,mp[pos].y={make_pair(y,val),make_pair(0,0)};
				cnt[i]=table[x];
				return;
			}
		}
	}
	int get(int x,int y){
		int mx=0;
		F(i,0,maxn-1) if(mp[i].x&&mp[i].x!=x){
			if(mp[i].y[0].x!=y) ckmax(mx,mp[i].y[0].y);
			if(mp[i].y[1].x!=y) ckmax(mx,mp[i].y[1].y);
		}
		return mx;
	}
}xx,yy;

int n,x,y,z,op,lastans;

int cnt;

signed main(){
    cin.tie(0)->sync_with_stdio(0);
	cin>>n;
	F(i,1,n){
		cin>>op;
		if(op==1){
			cin>>x>>y>>z;
			x^=lastans,y^=lastans,z^=lastans;
			debug(x,y,z);
			xx.push(x,y,z),yy.push(y,x,z);
		}
		else{
			cin>>x>>y;
			x^=lastans,y^=lastans,z^=lastans;
			debug(x,y);
			cnt++;
			int ans=(lastans=max(xx.get(x,y),yy.get(y,x)));
			cout<<ans<<endl;
		}
		debug(xx.table,yy.table);
	}
    return not "FST";
}
/*
 *
 *
 *
 *
 *
 *
 *
 */