#include <stdio.h>
#include <set>
#define MAXN 200000

using namespace std;

int P[MAXN+1];

int main() {
    multiset <int> chestie;
    multiset <int> :: iterator it;
	
	int a=0,b=0,i=0,n=0,K=1;
	
	freopen("heapuri.in","r",stdin);
	freopen("heapuri.out","w",stdout);
	
	scanf("%d",&n);
	
	for (i=0; i<n; ++i)
	{
		scanf("%d",&a);
		if (a==1) //insereaza b in heap
		{
			scanf("%d",&b); P[K++]=b;
			chestie.insert(b);
		}
		if (a==2) //sterge b din heap
		{
			scanf("%d",&b);
			chestie.erase(chestie.find(P[b]));
		}
		if (a==3) //val min din heap
		{
			it = chestie.begin();
			printf("%d\n",*it);
		}		
	}
	
	fclose(stdin);
	fclose(stdout);
    return 0;
}