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

using namespace std;

int N,c,i,v[200002],x;
vector<int> heap;
vector<int>::iterator it;

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

	scanf("%d",&N);
	for(i=1;i<=N;i++)
	{
		scanf("%d\n",&c);
		if(c==1)
		{
			scanf("%d",&v[++v[0]]);
			heap.push_back(v[v[0]]);
			push_heap(heap.begin(),heap.end());
		}
		else
		if(c==2)
		{
			scanf("%d",&x);
			it=find(heap.begin(),heap.end(),v[x]);
			heap.erase(it);
		}
		else
		printf("%d\n",heap.front());
	}

	return 0;
}