#include<iostream>
#include<cstdio>
#include<set>
using namespace std;

const int N = 210000;
int n, a[N], e, nr, op;
multiset<int> s;

int main() {
    int i;

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

    scanf("%d", &n);

    for(i = 1; i<=n; ++i) {
        scanf("%d", &op);

        if(op == 1) {

            scanf("%d", &e);
            a[++nr] = e;
            s.insert(e);
        }
        if(op == 2) {

            scanf("%d", &e);
            s.erase(s.find(a[e]));
        }
        if(op == 3)
            printf("%d\n", *s.begin());
    }

    return 0;
}