#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define punct pair<int,int>
#define NMax 200005

using namespace std;

struct compar{
	bool operator() (const punct &a, const punct &b)
	{
		return a.first>b.first;
	}
};
priority_queue<punct, vector<punct>, compar> Q;
int N, op, i, k, x, p, Poz[NMax], Ap[NMax];
int main()
{
    freopen("heapuri.in","r",stdin);
    freopen("heapuri.out","w",stdout);

    scanf("%d\n",&N);
    for(i=1;i<=N;i++)
    {
        scanf("%d",&op);
        if(op==1)
        {
            scanf("%d ",&x);
            Poz[++k]=x;
            Ap[k]++;
            Q.push(punct(x,k));
        }
        if(op==2)
        {
            scanf("%d",&p);
            Ap[p]--;
        }
        if(op==3)
        {
            while(!Ap[Q.top().second])
                Q.pop();
            printf("%d\n",Q.top().first);
        }
    }
    return 0;
}