#include <bits/stdc++.h>
using namespace std;
int v[200001], nr, i, val, n, x;
set <int> heap;
ifstream fin ("heapuri.in") ;
ofstream fout ("heapuri.out");

int main () {
    fin>>n;
    for (i=1;i<=n;i++) {
        fin>>val;
        if (val==1) {
            fin>>x;
            heap.insert(x);
            v[++nr]=x;
        } else if (val==2) {
            fin>>x;
            heap.erase(v[x]);
        } else if (val==3) {
            fout<<*heap.begin()<<"\n";
        }
    }



    return 0;
}