#include <fstream>
#include <vector>
#include <queue>
#include <set>
using namespace std;
using pii = pair<int,int>;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
const int nmax = 2e5 + 1;
int rem[nmax] , n , op , a , cnt;
signed main()
{
    multiset<int>mset;
    cin >> n;
    for(int i = 1 ; i <= n ; ++i)
    {
        cin >> op;
        if(op <= 2)
        {
            cin >> a;
            if(op == 1)
            {
                mset.insert(a);
                rem[++cnt] = a;
            }
            else{
                mset.erase(mset.find(rem[a]));
            }
        }
        else
        {
            auto it = mset.begin();
            cout << *it << '\n';
        }
    }
    return 0;
}