#include<iostream>
#include<bits/stdc++.h>
#include <fstream>
#include<unordered_map>
#include <queue>
using namespace std;

int main(){
	ifstream f ("heap.in");
	ofstream f1("heap.out");
	int n,k;
	int v[20000000];
	set<int> st;
	for (int i=0;i<n;i++){
		int ch,a;
		f>>ch;
		if (ch==1){
			f>>a;
			st.insert(a);
			v[k]=a;
			k++;
		}
		else if (ch==2){
			f>>a;
			st.erase(v[a-1]);
		}
		else if (ch==3){
			f1<<*st.begin()<<endl;
		}
	}
	
	
	
	
	return 0;
	
}