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

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

set<long> heap;
vector<long> ajut;

int main()
{
    int n, cod, x;
    fin >> n;
    for (int i=0; i<n; i++) {
        fin >> cod;
        if (cod == 1) {
            fin >> x;
            heap.insert(x);
            ajut.push_back(x);
        }
        else if (cod == 2) {
            fin >> x;
            heap.erase(ajut[x-1]);
        }
        else fout << *(heap.begin()) << endl;

    }

    return 0;
}