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

using namespace std;

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

set<int> heap;
int N, i, op, x, idx, pos[200001];

int main()
{
    f >> N;

    for (i = 0; i < N; i++)
    {
        f >> op;
        if (op == 1)
        {
            f >> x;
            heap.insert(x);
            pos[++idx] = x;
        }

        else if (op == 2)
        {
            f >> x;
            heap.erase(pos[x]);
        }

        else if (op == 3)
        {
            g << *heap.begin() << '\n';
        }

    }
}