#include <iostream>
#include <fstream>
using namespace std;
int N,v[200001],Heap[200001],poz[200001];
int minim(int Heap[])
{
    return Heap[1];
}
int tata(int nr)
{
    return nr/2;
}
int fiu_stang(int nr)
{
    return nr*2;
}
int fiu_drept(int nr)
{
    return nr*2+1;
}
void swap(int &a,int &b)
{
    int aux=a;
    a=b;
    b=aux;
}
void adaugare(int x)
{
    while(x/2!=0 && v[Heap[tata(x)]]>v[Heap[x]])
    {
        swap(Heap[tata(x)],Heap[x]);
        poz[Heap[x]]=x;
        poz[Heap[tata(x)]]=x/2;
        x=tata(x);
    }
}

void stergere(int x,int len)
{
    int y;
	while(x!=y)
	{
		y=x;
		if(2*y<=len && v[Heap[x]]>v[Heap[fiu_stang(y)]])
        {
            x=2*y;
        }
        if(2*y+1<=len && v[Heap[x]]>v[Heap[fiu_drept(y)]])
        {
            x=2*y+1;
        }
        swap(Heap[x],Heap[y]);
		poz[Heap[x]]=x;
		poz[Heap[y]]=y;
	}
}
int main()
{
    ifstream fin("heapuri.in");
    ofstream fout("heapuri.out");
    int i,k,x,nr=0,len=0;
    in>>N;
    for(i=1;i<=N;i++)
    {
        fin>>k;
        if(k==1 || k==2)
        {
            fin>>x;
            if(k==1)
            {
                nr++;
                len++;
			    v[nr]=x;
			    Heap[len]=nr;
			    poz[nr]=len;
                adaugare(poz[nr]);
            }
            if(k==2)
            {
                 v[x]=-1;
                 adaugare(poz[x]);
                 poz[Heap[1]]=0;
			     Heap[1]=Heap[len--];
                 poz[Heap[1]] = 1;
			     if(len>1)
                 {
                     stergere(1,len);
                 }
            }
        }
        else
        {
            fout<<minim(Heap)<<' ';
        }
    }
    fin.close();
    fout.close();
    return 0;
}