#include <iostream>
#include <fstream>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int Heap[200010],n,L,NR,p,x,A[200010],Pos[200010];
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 /= 2;
    }
}
void pop(int x)
{
    int aux, y = 0;

    while (x != y)
    {
        y = x;

        if (y*2<=L && A[Heap[x]]>A[Heap[y*2]]) x = y*2;
        if (y*2+1<=L && A[Heap[x]]>A[Heap[y*2+1]]) x = y*2+1;

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

        Pos[Heap[x]] = x;
        Pos[Heap[y]] = y;
    }
}
int main()
{
    f>>n;
    for(int i=1; i<=n; i++)
    {
        f>>p;
        if(p==1)
        {
            f>>x;
            L++, NR++;
            A[NR] = x;
            Heap[L] = NR;
            Pos[NR] = L;
            push(L);
        }
        if(p==2)
        {
        f>>x;
        A[x] = -1;
        //assert(Pos[x] != 0);
        //assert(1<=x && x<=NR);
        push(Pos[x]);

        Pos[Heap[1]] = 0;
        Heap[1] = Heap[L--];
        Pos[Heap[1]] = 1;
        if (L>1) pop(1);
        }

        if(p==3) g<<A[Heap[1]]<<'\n';
}
}