#include <bits/stdc++.h>

using namespace std;

int n, cod, x;
set <int> heap;
vector <int> ordine;

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

int main()
{
    in >> n;
    for(int i = 0; i < n; ++i)
    {
        in >> cod;
        if(cod == 1)
        {
            in >> x;
            heap.insert(x);
            ordine.push_back(x);
        }
        else if(cod == 2)
        {
            in >> x;
            heap.erase(ordine[x - 1]);
        }
        else
            out << *heap.begin() << "\n";
    }
    return 0;
}