#include <iostream>
#include <fstream>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
#include <set>
set<int> hheap;
int n, i, op, x, k, poz[300001];
int main()
{
    f>>n;
    for (i = 0; i < n; i++)
    {
        f >> op;
        if (op == 1)
        {
            f >> x;
            poz[++k]=x;  // retinem x-ul s in vectorul poz
            hheap.insert(x); //daca op=1 => inseram elementul x in heap
        }
        else if (op == 2)
        {
            f >> x;
            hheap.erase(poz[x]); //daca op=2 => stergem elementul al x-lea din heap, folosindu-ne de vectorul poz
        } else
            g << *hheap.begin() << '\n'; // daca op =3 => afisam elem minim din heap
    }
    return 0;
}