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