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

using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main()
{
    set<int> heap;
    unsigned int n, op, i, x, nr = 0;
    f >> n;
    int v[n];
    for(i = 1; i <= n; i++)
    {
        f >> op;
        if (op == 1 || op == 2)
        {

            f >> x;
            if(op == 1)
            {

                heap.insert(x);
                v[nr] = x;
                nr++;
            }
            else
            {
                heap.erase(v[x-1]);
            }
        }
        else g << *heap.begin() << '\n';
    }

    return 0;
}