#include<cstdio>
#include<fstream>
#include<set>
using namespace std;
#define N 200001
int v[N],nr,i,k,x,n;;
multiset<int>heap;
ifstream f;
int main(){
	f.open("heapuri.in");
	freopen("heapuri.out","w",stdout);
	f>>n;
	for(i=1;i<=n;++i){
		f>>k;
		if(k!=3) f>>x;;
		if(k==1){
			v[++nr]=x;
			heap.insert(x);
		}
		if(k==2)
			heap.erase(heap.find(v[x]));
		if(k==3)
			printf("%d\n",*heap.begin());
	}
	f.close();
	return 0;
}