#include <iostream>
#include <fstream>
#include <set>
#include <vector>
using namespace std;

set<int> heap;
vector<int>v;

int main(){
int x,n,poz,valoare;

ifstream f("heapuri.in");
ofstream g("heapuri.out");
v.push_back(0);
f>>n;
for (int i=1;i<=n;i++){
    f>>x;
    if (x==1){
        f>>valoare;
        heap.insert(valoare);
        v.push_back(valoare);
    }
    else if (x==2){
        f>>poz;
        heap.erase(v[poz]);
    }
    else if(x==3) {
        auto root=heap.begin();
        g<<*root<<"\n";
    }
}

return 0;
}