#include <fstream>
#include <set>
#define N 200005
using namespace std;

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

int n, a[N], ord;
set <int> heap;

int main()
{
    int i, op, x;
    fin >> n;

    for(i = 0; i < n; i++) {

        fin >> op;
        if(op == 1) {

            fin >> x;
            heap.insert(x);
            a[++ord] = x;
        }

        else if(op == 2) {

            fin >> x;
            heap.erase(a[x]);
        }

        else {

            fout << *(heap.begin()) << "\n";
        }
    }

    return 0;
}