#include <iostream>
#include <fstream>
#define NMAX 200005
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int arb[NMAX],n,m,a[NMAX],pos[NMAX];
int my_father(int nod){return nod/2;}
int left_son(int nod){return 2*nod;}
int right_son(int nod){return 2*nod+1;}
void percolate(int k)
{
    int father,poz=k;
    do
    {
        father=0;
        if(a[arb[my_father(poz)]]>a[arb[poz]])
        {
            father=1;
            swap(arb[my_father(poz)],arb[poz]);
            swap(pos[arb[my_father(poz)]],pos[arb[poz]]);
            poz=my_father(poz);
        }

    }while(father!=0&&poz>1);
}
void sift(int k)
{
    int son;
    cout<<k;
    do
    {
        son=0;
        if(left_son(k)<=m)
        {
            son=left_son(k);
            if(right_son(k)<=m&&a[arb[right_son(k)]]<a[arb[left_son(k)]])
                son=right_son(k);
            if(a[arb[son]]>=a[arb[k]])
                son=0;
        }
        if(son!=0)
        {
            swap(arb[son],arb[k]);
            swap(pos[arb[son]],pos[arb[k]]);
            k=son;
        }
    }while(son!=0);
}
int k;
void solve()
{
    int cod,x;
    f>>n;
    for(int i=1;i<=n;i++)
    {
        f>>cod;
        if(cod==3)
            g<<a[arb[1]]<<'\n';
        else
        {
            f>>x;
            if(cod==1)
            {
                ++k;
                a[k]=x;
                arb[++m]=k;
                pos[k]=m;
                percolate(m);
            }
            else
            {
                arb[pos[x]]=arb[m];
                pos[arb[m]]=pos[x];
                pos[x]=-1;
                if(pos[arb[m]]>1&&a[arb[pos[arb[m]]]]>a[arb[my_father(pos[arb[m]])]])
                    percolate(pos[arb[m]]);
                else
                    sift(pos[arb[m]]);
                --m;
            }
        }
        for(int j=1;j<=m;j++)
            cout<<a[arb[j]]<<" ";
        cout<<'\n';
    }
}
int main()
{
    solve();
    return 0;
}