#include <cassert>
#include <cstdio>

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

#define x first
#define y second

const int MAX_N = 200005;

priority_queue< pair<int, int>, vector< pair<int, int> >, greater< pair<int, int> > > heap;
bool bad[MAX_N];

int main() {
    assert(freopen("heapuri.in", "r", stdin));
    assert(freopen("heapuri.out", "w", stdout));

    int n;
    assert(scanf("%d", &n) == 1);
    int insert_cnt = 0;

    for (int i = 1; i <= n; ++i) {
        int op;
        assert(scanf("%d", &op) == 1);
     
        if (op == 1) {
            int val;
            assert(scanf("%d", &val) == 1);
            heap.push(make_pair(val, ++insert_cnt));
        } else if (op == 2) {
            int pos;
            assert(scanf("%d", &pos) == 1);
            bad[pos] = true;
        } else {
            pair<int, int> top;
            do {
                top = heap.top();
                heap.pop();
            } while (bad[top.y]);
            printf("%d\n", top.x);
        }
    }
}