#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main()
{
    set<int> heap;
    int n, k, p = 1, i[200000], v, v2;
    f >> n;
    for (int c = 0; c < n; c++)
    {
        f >> k;
        switch (k)
        {
            case 1:
                f >> v;
                heap.insert(v);
                i[p++] = v;
                break;
            case 2:
                f >> v2;
                heap.erase(i[v2]);
                break;
            case 3:
                g << *heap.begin() << endl;
                break;
        }
    }
    return 0;
}