#include <iostream>
#include <fstream>
#include <vector>
#include <set>

using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");

vector < long long > g;
multiset < long long > heap;

int nr;

int main(){
	fin >> nr;
	while(nr--){
		int op;
		fin >> op;
		if(op == 1){
			int n;
			fin >> n;
			heap.insert(n);
			g.push_back(n);
		}else if(op == 2){
			int n;
			fin >> n;
			heap.erase(heap.find(g[n-1]));
		}else{
			fout << *heap.begin() << '\n';
		}
	}
	return 0;
}