#include <fstream>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
const int N=200001;
const int maxim=1000001;
int h[N],nh,poz[5*N],v[N],n;
void urca(int p)
{
    while(p>1 && h[p]<h[p/2])
    {
        swap(h[p],h[p/2]);
        swap(poz[h[p]],poz[h[p/2]]);
        p=p/2;
    }
}
void adauga(int val)
{
    h[++nh]=val;
    poz[val]=nh;
    urca(nh);
}
void coboara(int p)
{
    int fs=p*2,fd=p*2+1,bun=p;
    if(fs<=nh && h[fs]<h[bun])
    {
        bun=fs;
        swap(h[p],h[bun]);
        swap(poz[h[p]],poz[h[bun]]);
    }

    if(fd<=nh && h[fd]<h[bun])
    {
        swap(h[fd],h[bun]);
        swap(poz[h[fd]],poz[h[bun]]);
        bun=fd;
    }
    if(bun!=p)
        coboara(bun);
}
int main()
{
    in>>n;
    int c,x,elem;
    for(int i=1;i<=n;i++)
    {
        in>>c;
        if(c==1)
        {
            in>>x;
            adauga(x);
            int p=poz[x];
            coboara(p);
            v[nh]=x;
        }
        else if(c==2)
        {
            in>>x;
            elem=v[x];
            int p=poz[elem];
            h[p]=maxim;
            coboara(p);
            nh--;
            //for(int j=1;j<=4;j++)
                //out<<h[j]<<' ';
            //out<<'\n';
        }
        else
            out<<h[1]<<'\n';
    }
    return 0;
}