#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <list>
#include <set>

using namespace std;

ifstream f("heapuri.in");
ofstream g("heapuri.out");

multiset<int>  v;
int nrint,intrat[200001];

int main()
{
    int n;
    f>>n;
    for(int i=0;i<n;++i)
    {
        int c,x;
        int e=0;
        f>>c;
        if(c==1)
        {
            f>>x;
            v.insert(x);
            intrat[++nrint] = x;

        }
        else if(c==2)
        {
            f>>x;
            v.erase(intrat[x]);

        }
        else
        {
           // make_heap(v.begin(), v.end(), greater<int> ());
            cout<<*(v.begin())<<"\n";

        }
    }
}