#include <cstdio>
#include <algorithm>

using namespace std;

#define maxN 200005

int H[maxN] , pozH[maxN] , dim;
int ordine[maxN] , ord;

int N , cod , x;

void pop (int nod)
{
	int f1 = nod * 2;
	int f2 = nod * 2 + 1;
	int nodmin = nod;
	
	if (f1 <= dim && ordine[H[f1]] < ordine[H[nodmin]])
		nodmin = f1;
	
	if (f2 <= dim && ordine[H[f2]] < ordine[H[nodmin]])
		nodmin = f2;
	
	
	if (nodmin == nod) return;
	
	swap (H[nodmin] , H[nod]);
	swap (pozH[H[nodmin]] , pozH[H[nod]]);
	
	pop (pozH[H[nodmin]]);

}


void push (int nod)
{
	int tata = nod / 2;
	
	if (nod == 1)
		return;
	
	if (ordine[H[tata]] <= ordine[H[nod]])
		return;
	
	swap (H[tata] , H[nod]);
	swap (pozH[H[tata]] , pozH[H[nod]]);
	
	push (pozH[H[tata]]);
}


void erase (int nod)
{
	swap (H[nod] , H[dim]);
	swap (pozH[H[nod]] , pozH[H[dim]]);
	
	--dim;
	
	pop (nod);
	//push (nod);
}


int main ()
{
	freopen ("heapuri.in" , "r" , stdin);
	freopen ("heapuri.out" , "w" , stdout);
	
	scanf ("%d" , &N);
	
	for (int i = 1 ; i <= N ; ++i)
	{
		scanf ("%d" , &cod);
		
		if (cod == 1)
		{
			scanf ("%d" , &x);
			
			ordine[++ord] = x;
			
			H[++dim] = ord;
			pozH[ord] = dim;
			
			push (pozH[ord]);
			
		}
		
		else if (cod == 2)
		{
			scanf ("%d" , &x);
			
			erase (pozH[x]);
		}
		
		else printf ("%d\n" , ordine[H[1]]);
	}
	
	return 0;
}