#include <stdio.h>
#include <assert.h>

#define maxn 200010

int N, L, NR;
int A[maxn], Heap[maxn], Pos[maxn];

#define SWAP(a, b){\
    a = a + b;\
    b = a - b;\
    a = a - b;\
}

inline int getLeft(int p){ return 2 * p;}
inline int getRight(int p){ return 2 * p + 1;}
inline int getParent(int p){ return p / 2;}
inline int getMin(){ return A[Heap[1]];}

/*void push(int x)
{
	int aux;

	while (x/2 && A[Heap[x]]<A[Heap[x/2]])
	{
		aux = Heap[x];
		Heap[x] = Heap[x/2];
		Heap[x/2] = aux;

		Pos[Heap[x]] = x;
		Pos[Heap[x/2]] = x/2;
		x /= 2;
	}
}*/

void push(int p){
	while(p > 1 && (A[Heap[p]] < A[Heap[getParent(p)]])){
		SWAP(Heap[p], Heap[getParent(p)]);
		Pos[Heap[p]] = p;
		Pos[Heap[getParent(p)]] = getParent(p);
		p = getParent(p);
	}
}

/*void pop(int x)
{
	int aux, y = 0;

	while (x != y)
	{
		y = x;

		if (y*2<=L && A[Heap[x]]>A[Heap[y*2]]) x = y*2;
		if (y*2+1<=L && A[Heap[x]]>A[Heap[y*2+1]]) x = y*2+1;

		aux = Heap[x];
		Heap[x] = Heap[y];
		Heap[y] = aux;

		Pos[Heap[x]] = x;
		Pos[Heap[y]] = y;
	}
}*/

void pop(int p){
	int son;
	do{
		son = 0;
		if(getLeft(p) <= L){
			son = getLeft(p);
			if(getRight(p) <= L && A[Heap[son]] > A[Heap[getRight(p)]])
				son = getRight(p);
		}
		if(son){
			if(A[Heap[son]] < A[Heap[p]]){
				SWAP(Heap[son], Heap[p])
				Pos[Heap[son]] = son;
				Pos[Heap[p]] = p;
				p = son;
			}
			else
				son = 0;
		}
	}while(son);
}

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

	int i, x, cod;

	scanf("%d ", &N);

	assert(1<=N && N<=200000);

	for (i=1; i<=N; i++)
	{
		scanf("%d ", &cod);
		assert(1<=cod && cod<=3);
		if (cod < 3)
		{
			scanf("%d ", &x);
			assert(1<=x && x<=1000000000);
		}

		if (cod == 1)
		{
			L++, NR++;
			A[NR] = x;
			Heap[L] = NR;
			Pos[NR] = L;

			push(L);
		}

		if (cod == 2)
		{
			A[x] = -1;
			assert(Pos[x] != 0);
			assert(1<=x && x<=NR);
			push(Pos[x]);

			Pos[Heap[1]] = 0;
			Heap[1] = Heap[L--];
			Pos[Heap[1]] = 1;
			if (L>1) pop(1);
		}

		if (cod == 3) printf("%d\n", A[Heap[1]]);
	}

	return 0;
}