#include <iostream>
#include <queue>
using namespace std;
priority_queue<int, vector<int>, greater<int> > q;
int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; ++ i)
    {
        int op, x;
        cin >> op;
        if(op == 1)
        {
            cin >> x;
            q.push(x);
        }
        else if(op == 2) cout << q.top() << '\n';
        else q.pop();
    }
    return 0;
}