#include <fstream>

using namespace std;

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

const int N= 200000;

int v[N+1], h[N+1], poz[N+1], n, nh;

void schimb(int p,int q)
{
    swap (h[p],h[q]);
    poz[h[p]]=p;
    poz[h[q]]=q;
}

void urca(int p)
{
    while (p>1 && v[h[p]]<v[h[p/2]])
    {
        schimb (p,p/2);
        p=p/2;
    }
}

void adauga(int val)
{
    h[++nh]=val;
    poz[val]=nh;
    urca(nh);
}

void coboara(int p)
{
    int fs=2*p, fd=2*p+1, bun=p;
    if (fs<=nh && v[h[fs]]<v[h[bun]])
    {
        bun=fs;
    }
    if (fd<=nh && v[h[fd]]<v[h[bun]])
    {
        bun=fd;
    }
    if (bun!=p)
    {
        schimb(p,bun);
        coboara(bun);
    }
}

void sterge(int p)
{
    if (p==nh)
    {
        nh--;
    }
    else
    {
        schimb(nh--,p);
        urca(p);
        coboara(p);
    }
}

int main()
{
    int nr_op;
    in>>nr_op;
    for (int i=0;i<nr_op;i++)
    {
        int tip;
        in>>tip;
        if (tip==1)
        {
            in>>v[++n];
            adauga(n);
        }
        else if (tip==2)
        {
            int p;
            in>>p;
            sterge(poz[p]);
        }
        else
        {
            out<<v[h[1]]<<"\n";
        }
    }
    return 0;
}