#1#2AC,33pts

#include <bits/stdc++.h>
using namespace std;
long long a, b, c, h[1000001], last = 0,l[1000001],ll=0;
int main() {
    cin >> a;
    for (int i = 1; i <= a; i++) {
        cin >> b;
        if (b == 1) {
            cin >> c;
            h[++last] = c;
            int nxt = last, now=last;
            while (now > 1) {
                nxt = now / 2;
                if (h[now] <= h[nxt]) {
                    break;
                }
                swap(h[nxt], h[now]);
                now = nxt;
            }
        }
        if (b == 2){
            cout << h[1] << endl;
        }
        if (b == 3) {
            h[1] = 0;
            h[1] = h[last];
            last--;
            int nxt, now = 1;
            while (nxt * 2 <= last) { 
                nxt = now * 2;
                if (nxt < last && h[nxt + 1] < h[nxt]) {
                    nxt++;
                }
                if (h[now] <= h[nxt]) {
                    break;
                }
                swap(h[now], h[nxt]);
                now = nxt;
            }
        }
    }
}