#include <iostream>
#include <fstream>
#include <set>

using namespace std;

ifstream f("heapuri.in");
ofstream g("heapuri.out");
int N, i, x, v[200005], poz = 0, operatie;
set <int> heap;


int main()
{
    f>>N;
    for (i = 1; i <= N; ++i)
    {
        f>>operatie;
        if(operatie == 1 || operatie == 2)
        {
            f>>x;
            if (operatie == 1)
            {
                heap.insert(x);
                v[poz++] = x;
            }
            else if(operatie == 2)
                heap.erase(v[x-1]);
        }
        else
            g<<*heap.begin()<<endl;
    }
    f.close();
    g.close();
    return 0;
}