#include<stdio.h>

int N, L, NR, x, y;
int A[200100], Heap[200100], Pos[200100];

void push(int x)
{
    int aux;
    while( x/2 && A[Heap[x]]<A[Heap[x/2]])
    {
        aux = Heap[x];
        Heap[x] = Heap[x/2];
        Heap[x/2] = aux;

        Pos[Heap[x]]=x;
        Pos[Heap[x/2]]=x/2;
        x=x/2;
    }
}

void pop(int x)
{
    int aux, y=0;
    while(x!=y)
    {
        y=x;
        if(2*y<=L && A[Heap[x]]>A[Heap[2*y]])
            x=2*y;
        if(2*y+1<=L && A[Heap[x]]>A[Heap[2*y+1]])
            x=2*y+1;

        aux = Heap[x];
        Heap[x] = Heap[y];
        Heap[y] = aux;

        Pos[Heap[x]]=x;
        Pos[Heap[y]]=y;
    }
}

int main()
{
    //freopen("input.in","r",stdin);
    freopen("heapuri.in", "r", stdin);
    freopen("heapuri.out", "w", stdout);
    scanf("%d",&N);
    for(int i=1;i<=N;++i)
    {
        scanf("%d",&x);
        if(x==1)
        {
            scanf("%d",&y);
            ++L;
            ++NR;
            A[NR]=y;
            Heap[L]=NR;
            Pos[NR]=L;
            push(L);
        }
        if(x==2)
        {

            scanf("%d",&y);
            A[y]=-1;
            push(Pos[y]);

            Pos[Heap[1]]=0;

            Heap[1]=Heap[L];

            --L;
            Pos[Heap[1]]=1;

            if(L>1)
                pop(1);
        }
        if(x==3)
            printf("%d\n",A[Heap[1]]);


    }
    return 0;

}