#include <fstream>
#include <set>
using namespace std;
set <int> heap;
int v[200011], t, cer, i, x;
int main()
{
    ifstream f("heapuri.in");
    ofstream g("heapuri.out");
    f >> t;
    for(i = 1; i <= t; ++ i)
    {
        f >> cer;
        if(cer == 1)
        {
            f >> x;
            v[++ v[0]] = x;
            heap.insert(x);
        }
        else if(cer == 2)
        {
            f >> x;
            heap.erase(v[x]); // stergem al v[x] element adaugat
        }
        else g << *heap.begin() << "\n";
    }
    return 0;
}