#include<fstream>
#include<vector>
#include<set>
#define HEAP_SIZE 200000
using namespace std;

set<int> h;
int v[HEAP_SIZE], k;

int main() {
    ifstream fin("heapuri.in");
    ofstream fout("heapuri.out");
    int op, x, n;
    fin >> n;
    for(int i = 0; i < n; ++i) {
        fin >> op;
        if(op < 3)
            fin >> x;
        if(op == 1) {
            v[k++] = x;
            h.insert(x);
        } else if(op == 2) {
            h.erase(h.find(v[x - 1]));
        } else fout << *h.begin() << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}