#include <bits/stdc++.h>
#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <unordered_set>
#include <unordered_map>
//#define x first
//#define y second
#define endl '\n'
#define pi acos(-1.0)
using namespace std;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<PII, int> PIII;
typedef pair<PII, char> PIIC;
typedef long long LL;
int dx[] = {1, 0, 0, -1, -1, -1, 1, 1}, dy[] = {0, -1, 1, 0, -1, 1, -1, 1};
int mou[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int N = 1e6 + 10, M = 110, mod = 998244353, INF = 0x3f3f3f3f;
const double eps = 1e-8;
int x,y,w,last,t;
struct node
{
    int x,y,w;
    bool operator<(const node& t)
    {
        return w>t.w;
    }
};
vector<node>v;

void insert(int x,int y,int w)
{
    v.push_back({x,y,w});
    sort(v.begin(),v.end());
    vector<node>t;
    int x0,y0,x1,y1,x2,y2,cnt=0;
    for(int i=0;i<v.size();i++)
    {
        if(cnt==0) //全集
        {
            x0=v[i].x,y0=v[i].y;
            t.push_back(v[i]);
            cnt=1;
        }
        else if(cnt==1) //一个十字
        {  
            //if(v[i].x==x0&&v[i].y==y0) continue;
            if(v[i].x==t[t.size()-1].x&&v[i].y==t[t.size()-1].y) continue;
            t.push_back(v[i]);
            if(v[i].x!=x0&&v[i].y!=y0)
            {
                x1=v[i].x,y1=v[i].y;
                cnt=2;
            }
            else if(v[i].x!=x0) x1=v[i].x,y1=y0,cnt=3;
            else if(v[i].y!=y0) y1=v[i].y,x1=x0,cnt=4;
        }
        else if(cnt==2) //两个格子
        {
            //if(v[i].x==x1&&v[i].y==y1) continue;
            if(v[i].x==t[t.size()-1].x&&v[i].y==t[t.size()-1].y) continue;
            t.push_back(v[i]);
            cnt=5;
            if((v[i].x!=x0&&v[i].y!=y1)&&(v[i].x!=x1&&v[i].y!=y0)) break;
            else if(v[i].x!=x0&&v[i].y!=y1) x2=x1,y2=y0;
            else if(v[i].x!=x1&&v[i].y!=y0) x2=x0,y2=y1;
        }
        else if(cnt==3) //一条竖线
        {
            if(v[i].x==t[t.size()-1].x&&v[i].y==t[t.size()-1].y) continue;
            if(v[i].y!=y1)
            {
                t.push_back(v[i]);
                x2=v[i].x,y2=y1;
                cnt=5;
            }
        }
        else if(cnt==4) //一条横线
        {
            if(v[i].x==t[t.size()-1].x&&v[i].y==t[t.size()-1].y) continue;
            if(v[i].x!=x1)
            {
                t.push_back(v[i]);
                x2=x1,y2=v[i].y;
                cnt=5;
            }
        }
        else if(cnt==5) //一个格子
        {
            if(v[i].x==t[t.size()-1].x&&v[i].y==t[t.size()-1].y) continue;
            if(v[i].x!=x2&&v[i].y!=y2)
            {
                t.push_back(v[i]);
                break;
            }
        }
    }
    v=t;
}

int query(int x,int y)
{
    for(auto i:v)
        if(x!=i.x&&y!=i.y) return i.w;
    return 0;
}

void solve()
{
    int op;
    cin>>op;
    if(op==1)
    {
        cin>>x>>y>>w;
        x^=last,y^=last,w^=last;
        insert(x,y,w);
    }
    else
    {
        cin>>x>>y;
        x^=last,y^=last;
        last=query(x,y);
        cout<<last<<endl;
    }
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0),cout.precision(10);
    // freopen("in.in","r",stdin);
    // freopen("test.out","w",stdout);  
    t=1; cin >> t;
    while (t--) solve();
    return 0;
}