#include <fstream>
#include <set>
#include <vector>

std::set<int> heap;
std::vector<int> ordine;

int main()
{
    std::ifstream fin("deque.in");
    std::ofstream fout("deque.out");

    ordine.push_back(-1);
    int n;
    fin >> n;

    for (int i = 0; i < n; ++i) {
        int op;
        fin >> op;

        if (op == 3) fout << *heap.begin() << '\n';
        else {
            int x;
            fin >> x;

            if (op == 1) heap.insert(x), ordine.push_back(x);
            else heap.erase(ordine[x]), ordine.erase(ordine.begin() + x - 1);
        }
    }

    return 0;
}