#include <bits/stdc++.h>

using namespace std;

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

int main()
{
    int i, N, op, nr_curent, ord[200001] = {}, k = 0;
    set<int> heap;
    /// set este mereu in ordine crescatoare
    in >> N;
    for (i = 1; i <= N; i++)
    {
        in >> op;
        switch (op)
        {

        case 1:
        {
            /// inserez numar curent
            in >> nr_curent;
            heap.insert(nr_curent);
            ord[++k] = nr_curent;
        }
        break;

        case 2:
        {
            /// sterg numar
            in >> nr_curent;
            heap.erase(ord[nr_curent]);
        }
        break;

        case 3:
        {
            /// afisez minim
            out << *heap.begin() << "\n";
        }
        break;

        }
    }
    return 0;
}