#include <bits/stdc++.h>
#define pii pair <int,int>
using namespace std;
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
priority_queue < pii ,vector < pii > , greater < pii > > pq ;
bool sel[200001] ;
int n , i , q , x , cnt ;
int main ()
{
    fin >> n ;
    for ( i = 1 ; i <= n ; i ++ )
    {
        fin >> q ;
        if ( q == 3 )
        {
            while ( ! pq.empty() && sel[pq.top().second] == true )
                pq.pop() ;
            fout << pq.top().first << '\n' ;
        }
        else
        {
            fin >> x ;
            if ( q == 1 )
            {
                cnt ++ ;
                pq.push( make_pair ( x , cnt ) ) ;
                sel[cnt] = false ;
            }
            else
                sel[x] = true ;
        }
    }

    return 0 ;
}