#include<fstream>>
#include<set>
#include<vector>
using namespace std;
int k,tip,x;

vector<int> poz(1);
multiset<int> heap;

int main()
{
	int i;
	ifstream fin("heapuri.in");
	ofstream fout("heapuri.out");
	fin>>k;
	poz.reserve(k+1);
	for(i=1;i<=k;i++)
	{
		fin>>tip;
		if(tip==3)
			fout<<*heap.begin() <<'\n';
		else
		{
			fin>>x;
			if(tip==2)
				heap.erase(heap.find(poz[x]));
			else
			{
				poz.push_back(x);
				heap.insert(x);
			}
		}
	}
	return 0;
}