///FLAVIUS, UBESTE-MA
#include <fstream>
#include <vector>
#include <queue>

using namespace std;


ifstream fin( "disjoint.in" );
ofstream fout("disjoint.out");
int v[ 200010 ],i,j,n,m,x,y;
priority_queue < pair<int,int> > pq;

int main()
{
    fin>>n;
    for( i = 1 ; i <= n ; i++ )
    {
        fin>>x;
        if( x == 1 )
        {
            fin>>x;
            pq.push( {x,i} );
        }
        else if( x == 2 )
        {
            fin>>x;
            v[ x ] = 1;
        }
        else
        {
            while( pq.top().second == 1 )
                pq.pop();
            fout<<pq.top().first<<'\n';
        }

    }

    return 0;
}