#include <iostream>
#include <fstream>
using namespace std;
int N,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,int Heap[])
{
    N++;
    Heap[N]=x;
    int k=N;
    while(k!=0 && Heap[tata(k)]>Heap[k])
    {
        swap(Heap[tata(k)],Heap[k]);
        poz[Heap[k]]=x;
        poz[Heap[tata(k)]]=x/2;
        k=tata(k);
    }
}

void stergere(int x,int Heap[],int counter)
{
    int y;
    swap(Heap[counter],Heap)
	while(x!=y)
	{
		y=x;
		if(2*y<=counter && Heap[x]>Heap[fiu_stang(y)])
        {
            x=2*y;
        }
        if(2*y+1<=counter && Heap[x]>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,counter=0,valoare=0;
    cin>>N;
    for(i=1;i<=N;i++)
    {
        cin>>k;
        if(k==1 || k==2)
        {
            cin>>x;
            if(k==1)
            {
                counter++;
                valoare++;
                poz[counter]=valoare;
                adaugare(x,Heap);
            }
            else
            {
                stergere(poz[x],Heap,counter);
            }
        }
        else
        {
            cout<<minim(Heap)<<' ';
        }

    }
    fin.close();
    fout.close();
    return 0;
}