#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

set<int> multE;
vector<int> elem;

void inserare(int nr) {
    elem.push_back(nr);
    multE.insert(nr);
}

void stergere(int pozitie) {
    int x = elem[pozitie];
    multE.erase(x);
}

int main() {
    ifstream fin("heapuri.in");
    ofstream fout("heapuri.out");
    int nr_op;
    fin >> nr_op;

    for (int i = 0; i < nr_op; ++i) {
        int tip_op, nr;
        fin >> tip_op;
        if (tip_op == 1) {
            fin >> nr;
            inserare(nr);
        } else if (tip_op == 2) {
            fin >> nr;
            stergere(nr - 1);
        } else if (tip_op == 3) {
            int minVal = *min_element(elem.begin(), elem.end());
            fout << minVal << endl;
        }
    }

    fin.close();
    fout.close();

    return 0;
}