#include <iostream>
#include <fstream>
#include <set>
#include <map>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n, cnt;
map <int, int> poz;
multiset <int> s;

int main()
{
    fin >> n;
    while (n--)
    {
        int op, nr, p;
        multiset <int> :: iterator it;

        fin >> op;
        if (op == 1)
        {
            fin >> nr;
            s.insert(nr);
            cnt++;
            poz[cnt] = nr;
        }
        else if (op == 2)
        {
            fin >> p;
            it = s.find(poz[p]);
            s.erase(it);
        }
        else
            fout << *s.begin() << "\n";
    }
    return 0;
}