#include<iostream>
#include<fstream>
#include <set>
#include <vector>
using namespace std;

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


set<int>heap;
vector <int> v;
int main() {

	

	int n;
	fin >> n;
	int comanda, x;
	v.push_back(-1);


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

		fin >> comanda;

		if (comanda == 1) {

			fin >> x;
			v.push_back(x);
			heap.insert(x);

		}
		else if (comanda == 2) 
		{

				fin >> x;
				heap.erase(v[x]);

		}
			else g << *heap.begin() << endl;

	}





	fin.close();
	g.close();
	return 0;
}