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

using namespace std;

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

int N, op, x, i, v[200000], idx;
set <int> heap;

int main()
{
	f >> N;
	idx = 1;

	for (i = 0; i < N; i++)
	{
		f >> op;
		if (op == 1)
		{
			f >> x;
			heap.insert(x);
			v[idx] = x;
			idx++;
		}
			
		else if (op == 2)
		{
			f >> x;
			heap.erase(v[x]);
		}
			
		else
			g << *heap.begin() << endl;
	}
}