#include <iostream>
#include <fstream>
#include <set>

using namespace std;

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

long long N, opt, x, poz, ordine[200005];
set<long long> heap;

int main() {
    fin >> N;
    for (int i = 1; i <= N; ++i) {
        fin >> opt;
        if (opt != 3)
            fin >> x;

        switch (opt) {
            case 1: {
                heap.insert(x);
                ordine[++poz] = x;
                break;
            }
            case 2: {
                heap.erase(ordine[x]);
                break;
            }
            case 3: {
                fout << *heap.begin() << "\n";
                break;
            }
        }
    }
    return 0;
}