#include <iostream>
#include <fstream>
#include <set>
#include <algorithm>
#define NMAX 200002
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set<int> heap;
int n, poz[NMAX], a, x, k;
int main() {
    fin >> n;
    for (int i = 0; i < n; i++) {
        fin >> x;
        switch(x) {
            case 1:
              fin >> a;
              heap.insert(a);
              poz[++k] = a;
              break;
            case 2:
              fin >> a;
              heap.erase(poz[a]);
              break;
            case 3:
              fout << *heap.begin() << '\n';
              break;
        }
    }
    return 0;
}