#include <stdio.h>
int const N=200001;
int nh,poz[N],v[N];

struct heap_item{
    int elm,ind;
} h[N];

void schimba(int a,int b)
{
    heap_item aux;
    poz[h[a].ind] = b;
    poz[h[b].ind] = a;
    aux=h[a];
    h[a]=h[b];
    h[b]=aux;
}

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

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

void adaug(int x)
{
    poz[++nh] = nh;
    h[nh].elm = x;
    h[nh].ind = nh;
    urca(nh);
}

void sterg(int p)
{
    schimba(nh--,p);
    urca(p);
    coboara(p);
}

int main()
{
    int i,n,cod,elem;
    freopen("heapuri.in","r",stdin);
    freopen("heapuri.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&cod);
        if(cod != 3) scanf("%d",&elem);
        if(cod == 1) adaug(elem);
        if(cod == 3) printf("%d\n",h[1]);
        if(cod == 2) sterg(poz[elem]);
    }
    return 0;
}