#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

using namespace std;

int n;

priority_queue <int, vector<int>, greater<int> >q;

int main()

{

    scanf("%d", &n);

    for (int i = ; i <= n; i++)

    {

        int id;

        scanf("%d", &id);

        if (id == )

        {

            int x;

            scanf("%d", &x);

            q.push(x);

        }

        if (id == )

            printf("%d\n", q.top());

        if (id == )

            q.pop();

    }

    return ;

}