#include <bits/stdc++.h>

using namespace std;
set<pair<int, int>>s;
int n, x, t, i, cnt, a[200005];
int main()
{
    freopen("heapuri.in", "r", stdin);
    freopen("heapuri.out", "w", stdout);
    scanf("%d", &n);
    for(i = 1; i <= n; i++)
    {
        scanf("%d", &t);
        if(t == 1)
        {
            scanf("%d", &x);
            cnt++;
            a[cnt]=x;
            s.insert((make_pair(x, cnt)));
            continue;
        }
        if(t == 2)
        {
            scanf("%d", &x);
            s.erase(s.find(make_pair(a[x], x)));
            continue;
        }
        printf("%d\n", s.begin()->first);
    }
    return 0;
}