#include <bits/stdc++.h>
using namespace std;
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
multiset < int > s;
multiset < int > :: iterator it;
unordered_map < int , int > M;
int  op , Q;
int main()
{
    int ind = 0 , x;
    fin >> Q;
    while(Q -- )
    {
        fin >> op;
        if(op == 1)
        {
            fin >> x;
            M[++ind] = x;
            s . insert(x);
        }
        else if(op == 2)
        {
            fin >> x;
            it = s . find(M[x]);
            s . erase(it);
        }
        else
        {
            it = s . begin();
            fout << * it << "\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}