#include <cstdlib>
#include <fstream>
#define Nmax 200111

/*
 *
 */
using namespace std;
int N;
int H[Nmax], P[Nmax], v[Nmax];
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 k )
{
    P[H[N]]=P[k];
    H[P[k]]=H[N];
    --N;
    DownHeap( P[k] );
}
inline void push( int k )
{
    H[++N]=k;
    P[k]=N;
    UpHeap( N );
}
int main( void )
{
    int M, i, j=0, k;
    ifstream in( "heapuri.in" );
    ofstream out( "heapuri.out" );
    for( in>>M; M; --M )
    {
        in>>i;
        switch( i )
        {
            case 1 : ++j, in>>v[j], push( j ); break;
            case 2 : in>>k, pop( k ); break;
            default : out<<v[H[1]]<<'\n';
        }
    }
    return EXIT_SUCCESS;
}