#include<cstdio>
#include<set>
#include<algorithm>
#define Max 200001
using namespace std;
multiset<int>q;
multiset<int>::iterator it;
int v[Max],t,x,n,m;
int main ()
{
	freopen("heapuri.in","r",stdin);
	freopen("heapuri.out","w",stdout);
	scanf("%d",&m);
	for(int j=1;j<=m;++j)
	{
		scanf("%d",&t);
		if(t==3)
			printf("%d",v[1]);
		else
		{
			scanf("%d",&x);
			if(t==1)
			{
				v[++n]=x;
				q.insert(x);
			}
			else
			{
				it=q.find(v[x]);
				q.erase(it);
			}
		}
	}
	return 0;
}