/* 
 * File:   main.cpp
 * Author: virtualdemon
 *
 * Created on May 9, 2010, 12:42 PM
 */
#include <cstdlib>
#include <fstream>
#define Nmax 200011

/*
 * 
 */
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]] > v[H[son+1]] )
            ++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 int pop( int k )
{
    int r=H[P[k]];
    P[H[N]]=k;
    H[P[k]]=H[N];
    --N;
    DownHeap( P[k] );
    return r;
}
inline void push( int k )
{
    H[++N]=k;
    P[k]=N;
    UpHeap( N );
}
int main(int argc, char** argv)
{
    int i, M, x, y;
    ifstream in( "heapuri.in" );
    ofstream out( "heapuri.out" );
    for( in>>M, i=1 ; M; --M )
    {
        in>>x;
        if( 1 == x )
        {
            in>>v[i];
            push( i );
            ++i;
        }
        else if( 2 == x )
             {
                    in>>y;
                    pop(y);
             }
             else out<<v[H[1]]<<'\n';
    }
    return (EXIT_SUCCESS);
}