#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

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

set <int> heap;
int poz_heap[200001];
int n, idx, elem;

void operatii(int op)
{
	if (op == 1)
	{
		fin >> elem;
		heap.insert(elem);
		idx += 1;
		poz_heap[idx] = elem;
	}
	else if (op == 2)
	{
		fin >> elem;
		heap.erase(poz_heap[elem]);
	}
	else fout << *heap.begin() << '\n';
}

int main()
{
	fin >> n;

	for (int i = 0; i < n; i++)
	{
		int op;
		fin >> op;
		operatii(op);
	}
	return 0;
}