#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define NMax 200005

using namespace std;

struct compar{
	bool operator() (int a, int b)
	{
		return a>b;
	}
};
priority_queue<int, vector<int>, 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[x]++;
            Q.push(x);
        }
        if(op==2)
        {
            scanf("%d",&p);
            x=Poz[p];
            Ap[x]--;
        }
        if(op==3)
        {
            while(!Ap[Q.top()])
                Q.pop();
            printf("%d\n",Q.top());
        }
    }
    return 0;
}