#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;};
giao p[5];
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;
            For(i,0,4){
                if(p[i].x==x||p[i].y==y||p[i].w==0){
                    p[i]={x,y,max(w,p[i].w)};
                    break;
                }
            }
        }
        else{
            ans=0;
            For(i,0,4){
                if((p[i].x!=x)&&(p[i].y!=y))ans=max(ans,p[i].w);
            }
            cout<<ans<<endl;
        }
    }
    return 0;
}
/*
5
 1 2 3 1
 1 4 5 2
 2 2 2
 2 3 7
 2 3 4
 */