#include<algorithm>
#include<vector>
#include<cstdio>
#include<map>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<iomanip>
#include<bitset>
#include<queue>
#include<cassert>
#include<stdlib.h>
#include<cmath>
#include<set>
#define TIME (double)clock()/(double)CLOCKS_PER_SEC
//#define ll long long
#define ld long double
#define For(i,l,r) for(int i=(l);i<=(r);++i)
#define rof(i,r,l) for(int i=(r);i>=(l);--i)
#define db double
#define mem0(a) memset(a,0,sizeof(a))
#define ull unsigned long long
#define lowbit(t) (t&-t)
#define uint unsigned int
//#define int long long
#define x1 dlskjfakljflkasd
#define y1 sldkfjalfjkalskl
#define x2 sdalkfjaklfjsdlk
#define y2 sfjaofoiwjfwfwof
using namespace std;
//const int N=5e3+1,inf=1e18,mod=998244353;
int q;
struct giao{int x,y,w;};
bool cmp(giao g1,giao g2){return g1.w>g2.w;}
giao p[6];
int m=-1;
int ans=0;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    cin>>q;
    while(q--){
        int op,x,y,w;
        cin>>op>>x>>y;
        x^=ans;y^=ans;
        if(op==1){
            cin>>w;
            w^=ans;
            p[++m]={x,y,w};
            sort(p+1,p+1+m,cmp);
            For(i,1,m){
                int c1=0,c2=0;
                For(j,0,i-1){
                    c1+=(p[j].x==p[i].x);
                    c2+=(p[j].y==p[i].y);
                }
                if(c1>1||c2>1)p[i]={0,0,0};
            }
            sort(p+1,p+1+m,cmp);
            m=min(m,4);
        }
        else{
            ans=0;
            For(i,0,m){
                if(p[i].x!=x&&p[i].y!=y){
                    ans=max(p[i].w,ans);
                }
            }
            cout<<ans<<endl;
        }
    }
    return 0;
}
/*
5
 1 2 3 1
 1 4 5 2
 2 2 2
 2 3 7
 2 3 4
 */