//
//  main.cpp
//  heap
//
//  Created by Vlad Calomfirescu on 26.04.2021.
//

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

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
vector <int> v;
vector <int> v1;
vector <bool> f;
int main() {
    int n,op,x;
    fin>>n;
    for (int i=0;i<n;i++)
    {
        fin>>op;
        if(op==1)
        {
            fin>>x;
            v.push_back(-x);
            f.push_back(true);
        }
        if (op==2)
        {
            fin>>x;
            f[x-1]=false;
//            v.erase(v.begin()+x-1);
        }
        if(op==3)
        {
            v1.clear();
            for (int j=0;j<v.size();j++)
            {
                if (f[j])
                    v1.push_back(v[j]);
            }
            sort(v1.begin(),v1.end());
//            make_heap(v1.begin(),v1.end());
//            v1.pop_back();
            fout<<-v1.at(v1.size()-1)<<endl;
        }
    }
    return 0;
}