#include <fstream>
#include <set>
using namespace std;
multiset <int> heap;
multiset <int> :: iterator p;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int v[200005];

int main()
{
    int n,x=0,k,c;
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>c;
        if(c==3)
        {
            p=heap.begin();
            fout<<*p<<endl;
        }
        else
        {
            if(c==1)
            {
                fin>>v[++x];
                heap.insert(v[x]);
            }
            else
            {
                fin>>k;
                p=heap.find(v[k]);
                heap.erase(*p);
            }
        }
    }
    return 0;
}