#include <fstream>
#include <queue>
using namespace std;

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

int n, c, x, ind;
bool v[1000000000];
priority_queue <pair <int, int> > q;

int main()
{
    f>>n;
    for(int i=1; i<=n; i++)
    {
        f>>c;
        if(c==1)
        {
            ind++;
            f>>x;
            q.push(make_pair(-x, ind));
        }
        else if(c==2)
        {
            f>>x;
            v[x]=1;
        }
        else
        {
            while(v[q.top().second]==1)
                q.pop();
            g<<-q.top().first<<'\n';
        }
    }
    return 0;
}