#include <bits/stdc++.h>


using namespace std;

ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");

multiset < pair < int , int > > Q;

multiset < pair < int , int > > :: iterator it;

unordered_map < int , int > M;

int q;

int main()
{
    int op , x , k = 0;
    fin >> q;
    while(q--)
    {
        fin >> op;
        if(op == 1)
        {
            fin >> x;
            Q.insert({x , ++k});
            M[k] = x;
        }
        else if(op == 2)
        {
            fin >> x;
            Q.erase(Q.find({M[x] , x}));
        }
        else
        {
            it = Q.begin();
            fout << it->first << "\n";
        }
    }
    fin.close();
    fout.close();
}