#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll>pi; typedef complex<double>cx;
#define int ll
#define X first
#define Y second
#define fer(i,a,n) for(int i=a;i<=n;i++)
#define ref(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define mem(a,x) memset(a,x,sizeof a)
#define ac IO;int t;cin>>t;while(t--)solve()
#define AC signed main(){IO;solve();}
#define NO {cout<<"No"<<endl;return;}
#define YES {cout<<"Yes"<<endl;return;}
#define re(a) {cout<<a<<endl;return;}
#define all(v) v.begin(),v.end()
//ofstream fout("1.out", ios::out);
//ifstream fin("1.in", ios::in);
//#define cout fout
//#define cin fin
//--------------------瑞神神中神--------------------

const int N=1e6+10;
int n;
struct node
{
   int x,y,w;
   bool operator<(const node&t)const
   {
       return w>t.w;
   }
};
set<node>se;

void solve()
{
   cin>>n;
   int ans=0;
   while(n--)
   {
       int op,x,y;
       cin>>op>>x>>y;
       x^=ans;y^=ans;
       if(op==1)
       {
           int w;cin>>w;
           w^=ans;
           int tw=0;
           for(auto[nx,ny,nw]:se)
           {
               if(x==nx&&y==ny)
               {
                   tw=nw;
               }
           }
           if(tw)
           {
               if(w>tw)
               {
                   se.erase({x,y,tw});
                   se.insert({x,y,w});
               }
           }
           else
           {
               se.insert({x,y,w});
           }
           vector<node>del;
           int sta=0,nx=0,ny=0,tx=0,ty=0,cnt=0;
           for(auto[x,y,w]:se)
           {
               cnt++;
               if(sta==0)
               {
                   sta=1;
                   nx=x;ny=y;
               }
               else if(sta==1)
               {
                   if(x!=nx&&y!=ny)
                   {
                       sta=4;
                       tx=x;ty=ny;
                       ny=y;
                   }
                   else if(x==nx)
                   {
                       sta=2;
                   }
                   else
                   {
                       sta=3;
                   }
               }
               else if(sta==2)
               {
                   if(x==nx)
                   {
                       del.push_back({x,y,w});
                   }
                   else
                   {
                       sta=5;ny=y;
                   }
               }
               else if(sta==3)
               {
                   if(y==ny)
                   {
                       del.push_back({x,y,w});
                   }
                   else
                   {
                       sta=5;
                       nx=x;
                   }
               }
               else if(sta==4)
               {
                    if(x==nx||y==ny)
                    {
                        sta=5;
                    }
                    else if(x==tx||y==ty)
                    {
                        sta=5;
                        swap(tx,nx);swap(ty,ny);
                    }
                    else
                    {
                        sta=6;
                    }
               }
               else if(sta==5)
               {
                   if(x==nx||y==ny)
                   {
                       sta=5;
                   }
                   else
                   {
                       sta=6;
                   }
               }
               if(sta==6)
               {
                   del.push_back({x,y,w});
               }
           }
           for(auto[x,y,w]:del)
           {
               se.erase({x,y,w});
           }
       }
       else
       {
           ans=0;
           for(auto[nx,ny,w]:se)
           {
               if(nx==x||ny==y)continue;
               ans=w;break;
           }
           cout<<ans<<'\n';
       }
   }
}

AC