#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
vector <int> v;

struct compara
{
    bool operator()(int x, int y)
        {
            return x>y;
        }
};

int hp()
{
    priority_queue <int, vector <int>, compara > q;
    for (int i=0; i<v.size(); i++)
        q.push(v[i]);
    return q.top();
}

int main()
{
    ifstream f("heapuri.in");
    ofstream g("heapuri.out");
    int n;
    f>>n;
    int stergeri=1;
    for (int i=1; i<=n; i++)
    {
        int operatie;
        f>>operatie;
        switch (operatie)
        {
        case 1:
            int e;
            f>>e;
            v.push_back(e);
            break;
        case 2:
            f>>e;
            v.erase(v.begin()+e-stergeri++);
            break;
        default:
            int p=hp();
            g<<p<<"\n";
            break;
        }
    }
    return 0;
}