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

using namespace std;


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

int main() {

    int N, v[1000], x, tip, k;
    //v este vector de pozitii

    set <int> heap;

    for (int i = 1; i <= N; i++) {
        f >> tip;
        if (tip == 1) {
            f >> x;
            heap.insert(x);
            v[++k] = x;
        }
        if (tip == 2) {
            f >> x;
            heap.erase(v[x]);
        } else {
            g << *heap.begin() << '\n';
        }
    }

    return 0;
}