/*
https://infoarena.ro/heapuri
*/

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

using namespace std;

set<int> heap;
int a[1000000];
int n;

int main() {
	ifstream in("heapuri.in");
	ofstream out("heapuri.out");

	in >> n;
	int c = 0;
	for(int i = 0; i < n; i++) {
		int t;
		in >> t;

		switch(t) {
			case 1: 
				int l;
				in >> l;
				heap.insert(l);
				a[c] = l;
				c++;
				break;
			case 2:
				int s;
				in >> s;
				heap.erase(a[s-1]);
				break;
			case 3:
				out << *heap.begin() << "\n";
				break;
		}
	}

	in.close();
	out.close();
	return 0;
}