#include<bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set<int> heap;
int v[200001], nr, n, op, x;
int main(){
    fin >> n;
    while(n--){
        fin >> op;
        if(op == 1){
            fin >> x;
            heap.insert(x);
            v[++nr] = x;
        }else if(op == 2){
            fin >> x;
            heap.erase(v[x]);
        }else{
            fout << *heap.begin() << '\n';
        }
    }
    return 0;
}