/* 
 * File:   main.cpp
 * Author: VirtualDemon
 *
 * Created on April 10, 2010, 9:08 AM
 */
#include <cstdlib>
#include <fstream>
#define Nmax 200010

/*
 * 
 */
using namespace std;
int N;
int H[Nmax], P[Nmax], v[Nmax];
inline void swap( int& x, int& y )
{
    int aux=x;
    x=y;
    y=aux;
}
inline void DownHeap( int k )
{
    for( int son=2*k; son <= N; k=son, son*=2 )
    {
        if( son < N && v[H[son+1]] < v[H[son]] )
            ++son;
        if( v[H[k]] <= v[H[son]] )
            return;
        swap( H[k], H[son] );
        P[H[k]]=k;
        P[H[son]]=son;
    }
}
inline void UpHeap( int k )
{
    for( int key=v[H[k]], f=k/2; k > 1 && key < v[H[f]]; k=f, f/=2 )
    {
        swap( H[k], H[f] );
        P[H[k]]=k;
        P[H[f]]=f;
    }
}
inline void pop( int x )
{
    int y=P[x];
    P[x]=P[H[N]];
    H[y]=H[N];
    --N;
    DownHeap( y );
}
inline void push( int k )
{
    H[++N]=k;
    P[k]=N;
    UpHeap( N );
}
int main(int argc, char** argv)
{
    int M, k, i, j;
    ifstream in( "heapuri.in" );
    ofstream out( "heapuri.out" );
    v[0]=0x3f3f3f3f;
    for( k=1, in>>M; M; --M, ++k )
    {
        in>>i;
        if( i <= 2 )
        {
            in>>j;
            if( 1 == i )
                v[k]=j, push( k ), ++k;
            else pop(j);
        }
        else out<<v[H[1]]<<'\n';
    }
    return EXIT_SUCCESS;
}