#include<stdio.h>
#include<algorithm>

using namespace std;

FILE *in, *out;

//definitions

//constants
const int sz = (int) 2e5+1;

//variables
int nOperations;
int type, value;

int heap[sz];
int appear[sz];
int position[sz];

int elem, lenght;

//functions
void insert(int pos);
void erase(int pos);

int main(void)
{
	in = fopen("heapuri.in", "rt");
	out = fopen("heapuri.out", "wt");
	
	fscanf(in,"%d", &nOperations);
	
	for(int i=1; i<=nOperations; ++i)
	{
		fscanf(in, "%d", &type);
		
		if(type == 1)
		{
			fscanf(in, "%d", &value);
			
			appear[++elem] = value;
			heap[++lenght] = elem;
			position[elem] = lenght;
			
			insert(lenght);
		}
		else if( type == 2)
		{
			fscanf(in, "%d", &value);
			
			appear[value] = -1;
			
			erase(position[value]);
		}
		else
			fprintf(out, "%d\n", appear[heap[1]]);
	}
	
	fclose(in);
	fclose(out);
	return 0;
}

void insert(int pos)
{
	int son = pos, father = son/2;
	
	while( father && appear[heap[son]] < appear[heap[father]] )
	{
		swap(heap[son], heap[father]);
		
		position[heap[son]] = son;
		position[heap[father]] = father;
		
		son = father;
		father /=2;
	}
}


void erase(int pos)
{
	int father = pos, son = father*2;
	
	if(son <= lenght)
	{
		position[heap[lenght]] = pos;
	
		heap[pos] = heap[lenght--];
	
		while (son <= lenght)
		{
			if( son+1 <= lenght)
				son = appear[heap[son]] > appear[heap[son+1]] ? son+1 : son;
			
			if(appear[heap[father]] > appear[heap[son]])
			{
				swap(heap[father], heap[son]);
				
				position[heap[father]] = father;
				position[heap[son]] = son;
			}
			else break;
		}
	}
}