#include <iostream>
#include <fstream>
#include <set>
using namespace std;

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

int n, x;
int numar, ordineCronologica[200005], nrNumere;
set <int> heap;

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        fin >> x;
        if (x == 1)
        {
            fin >> numar;
            nrNumere++;
            ordineCronologica[nrNumere] = numar;
            heap.insert(numar);
        }
        else if (x == 2)
        {
            int indice;
            fin >> indice;
            heap.erase(ordineCronologica[indice]);
        }
        else if (x == 3)
        {
            fout << *heap.begin() << '\n';
        }
    }
    return 0;
}