#include <fstream>
#include <iostream>
#include <set>
using namespace std;

ifstream f("heapuri.in");
ofstream g("heapuri.out");

set <int> heap;
int v[200005], k, q, i, t, x;

int main()
{
    f >> q;
    for(i = 1; i <= q; ++ i)
    {
        f >> t;
        if(t == 1)
        {
            f >> x;
            v[++ k] = x;
            heap.insert(x);
        }
        else if(t == 2)
        {
            f >> x;
            heap.erase(v[x]);
        }
        else g << *heap.begin() << "\n";
    }

    f.close();
    g.close();
    return 0;
}