#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <set>

using namespace std;

ifstream fin ("heapuri.in");
ofstream fout("heapuri.out");

struct cmp
{
    bool operator()(int &a, int &b)
    {
        return a>b;
    }
};
multiset<int>S;
///priority_queue<int,vector<int>,cmp>Q;
int fr[20001];
int main()
{
    int n,x,op,p,nr=0;
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>op;
        if(op==1)
        {
            fin>>x;
            S.insert(x);
            fr[++nr]=x;
        }
        else if(op==3)
            fout<<*S.begin()<<'\n';
        else
        {
            fin>>p;
            S.erase(S.find(fr[p]));
        }
    }
    return 0;
}