#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

#define maxN 200005

int H[maxN] , pozH[maxN] , A[maxN] , dim , dim2 , N;

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



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

}


void adaug (int x)
{
	A[++dim2] = x;
	
	pozH[dim2] = ++dim;
	H[dim] = dim2;
	
	push (pozH[dim2]);
}



void sterg (int x)
{
	swap (H[x] , H[dim]);
	swap (pozH[H[x]], pozH[H[dim]]);
	
	--dim;
	
	pop (pozH[H[x]]);
	push (pozH[H[x]]);
}


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