#include <fstream>

#include <set>

#include <vector>

using namespace std;

ifstream fin ("heapuri.in");

ofstream fout ("heapuri.out");

int main () {

	int n;

	fin >> n;

	set<int> heap;

	vector<int> poz;

	for (int i = 1; i <= n; ++i) {

		int op, x;

		fin >> op;

		if (op == 1) {

			fin >> x;

			heap.insert(x);

			poz.push_back(x);
		}
		else {

			if (op == 2) {

				fin >> x;

				heap.erase(poz[x - 1]);
			}
			else
				fout << *heap.begin() << '\n';
		}
	}

	return 0;
}