#include <cstdio>
#include <set>
#include <algorithm>

using namespace std;

const int NMAX = 200010;

multiset<int> H;
int v[NMAX];
int N;

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

    scanf ("%d", &N);

    for (int i = 1; i <= N; i++) {
        int tip, X;
        scanf ("%d", &tip);
        if (tip == 1) {
            scanf ("%d", &X);
            v[++v[0]] = X;
            H.insert (X);
        }
        else {
            if (tip == 2) {
                scanf ("%d", &X);
                H.erase (v[X]);
            }
            else {
                printf ("%d\n", *upper_bound (H.begin (), H.end (), 0));
            }
        }
    }

    return 0;
}