#include <iostream>
#include <fstream>
#define Nmax 200001

using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");

int n, v[Nmax], ord[Nmax], nr, s;

int it_exists(int x)
{
    for(int i=1;i<=nr;i++)
    {
        if(v[i]==x)
            return i;
    }
    return -1;
}
void inserare(int x, int k)
{
    v[k]=x;
    while(k>1 && v[k]<v[k/2])
    {
        swap(v[k], v[k/2]);
        k=k/2;
    }
}
void stergere(int k)
{
    v[k]=v[nr];
    nr--;
    while(k<=nr/2 && (v[k]>v[2*k] || (2*k+1<=nr && v[k]>v[2*k+1])))
    {
        int ind;
        if(2*k+1>nr || v[2*k]<v[2*k+1])
            ind=2*k;
        else
            ind=2*k+1;
        swap(v[k], v[ind]);
        k=ind;
    }
}
int main()
{
    f>>n;
    for(int i=1;i<=n;i++)
    {
        int x;
        f>>x;
        if(x==1)
        {
            f>>x;
            ord[++s]=x;
            nr++;
            inserare(x, nr);
        }
        else if(x==2)
        {
            f>>x;
            stergere(it_exists(ord[x]));
        }
        else
            g<<v[1]<<"\n";
    }
}