#include<cstdio>
#include<ext/pb_ds/priority_queue.hpp>
#define pd __gnu_pbds
#define heaptag pairing_heap_tag
#define heap priority_queue
pd::heap<int,std::greater<int>,pd::heaptag> Heap;
int main() {
    int n,opt,x; scanf("%d",&n);
    for (int i = 1; i <= n; ++i) {
        scanf("%d",&opt);
        switch (opt) {
            case 1:{
                scanf("%d",&x);Heap.push(x);
                break;
            }
            case 2:printf("%d\n",Heap.top());break;
            case 3:Heap.pop();break;
        }
    }
    return 0;
}