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

using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");

set <int>heap;

int main()
{
    int n, i, operatie, nr, index = 1, poz[200000];
    fin>>n;

    for(i=0; i<n; i++)
    {
        fin>>operatie;
        switch(operatie)
        {
            case 1:
                {
                    fin>>nr;
                    heap.insert(nr);
                    poz[index++] = nr;
                    break;
                }
            case 2:
                {
                    fin>>nr;
                    heap.erase(poz[nr]);
                    break;
                }
            case 3:
                {
                    fout<<*heap.begin()<<endl;
                    break;
                }
        }
    }
    return 0;
}