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

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

multiset<int> heap;

int main()
{

	int n, op, x,v[200001],k=0;

	fin >> n;

	for (int i = 0; i < n; i++)
	{
		fin >> op;
		if (op == 1)
		{
			fin >> x;
			heap.insert(x);
			v[k++] = x;
		}
		else if (op == 2)
		{
			fin >> x;
			heap.erase(heap.find(v[x - 1]));
		}
		else
		{
			fout << *heap.begin() << "\n";
		}
	}

	return 0;
}