#include <fstream>
#include <vector>
#include <unordered_set>
#include <queue>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
long long n, b, a;
unordered_set<int> m;
vector<int> v;
priority_queue<int> p;
int main(){

    in>>n;
    for(int i=0;i<n;++i){
        in>>a;
        if(a==1){
            in>>b;
            p.push(-b);
            v.push_back(b);
            m.insert(b);
        }
        else if(a==2){
            in>>b;
            m.erase(v[b-1]);
        }
        else{
            b=-p.top();
            while(m.find(b)==m.end()){
                p.pop();
                b=-p.top();
            }
            out<<-p.top()<<endl;
        }
    }
    return 0;
}