#include <bits/stdc++.h>

using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");

set<int> heap;
vector<int> ordineInserare;

int main()
{
    int n,cod,x;
    fin>>n;
    ordineInserare.push_back(0);

    for (int i=0; i<n; i++) {
        fin>>cod;

        switch (cod){
        case 1:
            fin>>x;
            ordineInserare.push_back(x);
            heap.insert(x);
            break;
        case 2:
            fin>>x;
            heap.erase(ordineInserare[x]);
            break;
        case 3:
            fout<<*heap.begin()<<'\n';
            break;
        }
    }

    fin.close();
    fout.close();
    return 0;
}