#include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
#define NMAX 200001
int N;
int NR = 0;
int V[NMAX];
multiset<int> S;

void rezolva()
{
	int iden, x;
	scanf("%d",&N);
	for(int i = 1 ; i <= N ; i++)
	{
		scanf("%d",&iden);
		if(iden == 1){
			scanf("%d",&x);
			V[++NR] = x;
			S.insert(x);
		}
		if(iden == 2){
			scanf("%d",&x);
			S.erase(V[x]);
		}
		if(iden == 3)
			printf("%d\n",*S.begin());
	}
}

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