#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

pii best[ 32 ][ 2 ][ 2 ] ;

int query ( int x , int y ) {
    int ret = 0 ;
    for ( int bit = 0 ; bit < 30 ; ++ bit ) {
        int wh = 0 ;
        if ( ( x & ( 1 << bit ) ) == 0 ) { wh = 1 ; }
        if ( best[ bit ][ wh ][ 0 ].se == y ) {
            ret = max ( ret , best[ bit ][ wh ][ 1 ].fi ) ;
        }
        else {
            ret = max ( ret , best[ bit ][ wh ][ 0 ].fi ) ;
        }
    }
    return ret ;
}

void add ( int x , int y , int w ) {
    for ( int bit = 0 ; bit < 30 ; ++ bit ) {
        int wh = 0 ;
        if ( ( x & ( 1 << bit ) ) > 0 ) { wh = 1 ; }
        if ( best[ bit ][ wh ][ 0 ].se == y ) {
            best[ bit ][ wh ][ 0 ].fi = max ( best[ bit ][ wh ][ 0 ].fi , w ) ; 
        }
        else if ( best[ bit ][ wh ][ 1 ].se == y ) {
            best[ bit ][ wh ][ 1 ].fi = max ( best[ bit ][ wh ][ 1 ].fi , w ) ; 
        }
        else {
            if ( best[ bit ][ wh ][ 0 ].fi < w ) {
                best[ bit ][ wh ][ 1 ] = best[ bit ][ wh ][ 0 ] ;
                best[ bit ][ wh ][ 0 ] = { w , y } ;
            }
            else if ( best[ bit ][ wh ][ 1 ].fi < w ) {
                best[ bit ][ wh ][ 1 ] = { w , y } ;
            }
        }
    }
}

void solve ( ) {
    int q ; cin >> q ;
    int lst = 0 ;
    while ( q -- ) {
        int type ; cin >> type ;
        int x , y , w ;
        if ( type == 1 ) {
            cin >> x >> y >> w ;
            x ^= lst , y ^= lst , w ^= lst ;
            add ( x , y , w ) ;
        }
        else {
            cin >> x >> y ;
            x ^= lst , y ^= lst ;
            lst = query ( x , y ) ;
            cout << lst << "\n" ;
        }
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}