#include <bits/stdc++.h>
using namespace std;

typedef long long ll; typedef unsigned long long ull;
const int inf = 1e9; const ll llnf = 4e18;

template< class Tp > void chkmax( Tp &x , Tp y ) { x = max( x , y ); }
template< class Tp > void chkmin( Tp &x , Tp y ) { x = min( x , y ); }

// 若干个十字的交
// 一定是 <= 1 个横线, <= 1 个竖线, <= 2 个单点 的并

struct Info {
private:
	int x , y; vector< pair< int , int > > z;

public:
	Info( int x0 , int y0 ) { x = x0 , y = y0 , z.clear( ); }
	Info comp( int x0 , int y0 ) const {
		Info ans = Info( x , y );
		if( x != -1 && x != x0 ) ans.x = -1 , ans.z.emplace_back( x , y0 );
		if( y != -1 && y != y0 ) ans.y = -1 , ans.z.emplace_back( x0 , y );
		for( auto [ u , v ] : z ) if( u == x0 || v == y0 ) ans.z.emplace_back( u , v );
		sort( ans.z.begin( ) , ans.z.end( ) ) , ans.z.erase( unique( ans.z.begin( ) , ans.z.end( ) ) , ans.z.end( ) );
		return ans;
	}
	bool sam( const Info &that ) const { return x == that.x && y == that.y && z == that.z; }
} ;

void solve( ) {
	int q; cin >> q;

	vector< tuple< int , int , int > > useful; int lstans = 0;
	while( q -- ) {
		int opt; cin >> opt;
		if( opt == 1 ) {
			int x , y , w; cin >> x >> y >> w; x ^= lstans , y ^= lstans , w ^= lstans;
			useful.emplace_back( w , x , y ); sort( useful.begin( ) , useful.end( ) , greater< tuple< int , int , int > >( ) );
			vector< tuple< int , int , int > > nuseful{ useful[0] }; Info info( get< 1 >( useful[0] ) , get< 2 >( useful[0] ) );
			for( int i = 1; i < ( int ) useful.size( ); i ++ ) {
				Info ninfo = info.comp( get< 1 >( useful[i] ) , get< 2 >( useful[i] ) );
				if( !info.sam( ninfo ) ) nuseful.emplace_back( useful[i] ) , info = ninfo;
			}
			useful = nuseful;
		}
		if( opt == 2 ) {
			int x , y; cin >> x >> y; x ^= lstans , y ^= lstans;
			int ans = 0; for( auto [ w , u , v ] : useful ) if( u != x && v != y ) chkmax( ans , w );
			cout << ans << "\n"; lstans = ans;
		}
	}
}

int main( ) {
	ios::sync_with_stdio( 0 ), cin.tie( 0 ), cout.tie( 0 );
	int T = 1; while( T -- ) solve( ); return 0;
}