#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
#include<set>
#include<map>
#include<cmath>
#include<climits>
#include<ctime>
#include<iomanip>
using namespace std ;

#define maxn 200005

int N, nr, v[maxn] ;

set<int> s ;

int main()
{
	std::ios_base::sync_with_stdio(false) ;

	freopen("heapuri.in", "r", stdin);
	freopen("heapuri.out", "w", stdout);

    cin >> N ;

    for(int i = 1; i <= N; ++i)
    {
        int op, x ;

        cin >> op ;

        if( op == 1 )
        {
            cin >> x ;
            s.insert(x) ;
            v[++nr] = x ;
        }

        if( op == 2 )
        {
            cin >> x ;
            s.erase( v[x] ) ;
        }

        if( op == 3 )
        {
            set<int>::iterator it = s.begin() ;
            cout << *it << "\n" ;
        }
    }

	return 0 ;
}