#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")


#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int,int>
#define pil pair<int,ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vvpii vector<vector<pair<int,int>>>
#define vvpll vector<vector<pair<ll,ll>>>

template<typename T> void debug(T e){
    cerr << e << endl;
}

template<typename T> void debug(vector<T> &v){
    rep(i, v.size()){
        cerr << v[i] << " ";
    }
    cerr << endl;
}

template<typename T> void debug(vector<vector<T>> &v){
    rep(i, v.size()){
        rep(j, v[i].size()){
            cerr << v[i][j] << " ";
        }
        cerr << endl;
    }
}

template<typename T> void debug(vector<pair<T, T>> &v){
    rep(i,v.size()){
        cerr << v[i].first << " " << v[i].second << endl;
    }
}

template<typename T> void debug(set<T> &st){
    for (auto itr = st.begin(); itr != st.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(multiset<T> &ms){
    for (auto itr = ms.begin(); itr != ms.end(); itr++){
        cerr << *itr << " ";
    }
    cerr << endl;
}

template<typename T> void debug(map<T, T> &mp){
    for (auto itr = mp.begin(); itr != mp.end(); itr++){
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out(){
    cerr << endl;
}

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
    cerr << H << " ";
    debug_out(T...);
}

int main(){
    ll Q;
    cin >> Q;
    vl bit(30, 0);
    vl bit_zero(30, 0);
    unordered_set<ll> st;
    for (ll i = 0; i < Q; i++){
        ll n;
        cin >> n;
        if (n == 1){
            ll x;
            cin >> x;
            if (st.find(x) == st.end()){
                st.insert(x);
                for (ll j = 0; j < 30; j++){
                    if ((x >> j) & 1){
                        bit[j]++;
                    }
                    else{
                        bit_zero[j]++;
                    }
                }
            }
        }
        else if (n == 2){
            ll x;
            cin >> x;
            if (st.find(x) != st.end()){
                st.erase(x);
                for (ll j = 0; j < 30; j++){
                    if ((x >> j) & 1){
                        bit[j]--;
                    }
                    else{
                        bit_zero[j]--;
                    }
                }
            }
        }
        else{
            if (st.empty()){
                cout << -1 << endl;
            }
            else{
                //debug(bit);
                //debug(bit_zero);
                ll ans = 0;
                for (ll j = 0; j < 30; j++){
                    if (bit[j] >= 1 && bit_zero[j] == 0){
                        ans += (1 << j);
                    }
                }
                cout << ans << endl;
            }
        }
    }
}