void solve() {  
   int q;  
   cin >> q;  
   int mn = INT_MAX;  
   pi mx_pair;  
  
   multiset<int> val, val_xor;  
  
   while (q--) {  
      int cmd, x;  
      cin >> cmd;  
      if (cmd == 1) {  
         cin >> x;  
         auto it = val.insert(x);  
         int prev = -1, nxt = -1;  
         auto it_nxt = it;  
         it_nxt++;  
         if (it_nxt != val.end()) nxt = *it_nxt;  
         if (it != val.begin()) {  
            --it;  
            prev = *it;  
         }  
         if (nxt != -1 && prev != -1) val_xor.erase(val_xor.find(prev ^ nxt));  
         if (nxt != -1) val_xor.insert(x ^ nxt);  
         if (prev != -1) val_xor.insert(x ^ prev);  
      } else if (cmd == 2) {  
         cin >> x;  
         auto it = val.erase(val.find(x));  
         int nxt = -1, prev = -1;  
         if (it != val.end()) nxt = *it;  
         if (it != val.begin()) {  
            --it;  
            prev = *it;  
         }  
         if (nxt != -1) val_xor.erase(val_xor.find(nxt ^ x));  
         if (prev != -1) val_xor.erase(val_xor.find(prev ^ x));  
  
         if (prev != -1 && nxt != -1)  
            val_xor.insert(prev ^ nxt);  
      } else {  
         cout << *val_xor.begin() << endl;  
      }  
   }  
}