#include <bits/stdc++.h>

using namespace std;

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

set <int> s;
int ins[200005];

int main()
{
    fin.tie(0); fin.sync_with_stdio(false);
    int n; fin>>n;
    while (n) {
        int op; fin>>op;
        if (op==1) {
            int elem; fin>>elem;
            ins[++ins[0]]=elem;
            s.insert(elem);
        }
        if (op==2) {
            int elem; fin>>elem;
            s.erase(s.find(ins[elem]));
        }
        if (op==3) {
            fout<<*s.begin()<<'\n';
        }
        n--;
    }
    return 0;
}