#include <bits/stdc++.h>
#include <unordered_set>
#include <vector>

using namespace std;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;

#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) begin (x), end(x)
#define sz(x) (int) (x).size()
#define rep(i,a,b) for (int i = (a); i < (b); i++)

mt19937 rng(random_device{}());

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	unordered_set<ll> v;

	ll q;
	cin >> q;

	for(ll i = 0; i < q; i++){
		ll op, num;
		cin >> op;
		if(op == 1){
			cin >> num;
			v.insert(num);
		}else if(op == 2){
			cin >> num;
			if(v.count(num)){
				v.erase(num);
			}
		}else if(op == 3){
			if(v.size() > 0){
				ll bitwiseResult = -1;
				for(auto element : v){
					if(bitwiseResult == -1){
						bitwiseResult = element;
					}else{
						bitwiseResult = bitwiseResult & element;
					}
					if(bitwiseResult == 0){
						break;
					}
				}
				cout << bitwiseResult << endl;
			}else{
				cout << -1 << endl;
			}
		}
	}

	return 0;
}