#include <cstdio>
#include <set>

using namespace std;

set<int> heap;
int v[200002];

int main()
{
	freopen("heapuri.in", "r", stdin);
	freopen("heapuri.out", "w", stdout);

	int n, t;
	scanf("%d", &n);

	for (int i = 1, k = 0; i <= n; i++)
	{
		scanf("%d", &t);
		if (t == 1)
		{
			++k;
			scanf("%d", &v[k]);
			heap.insert(v[k]);
		}
		else if (t == 2)
		{
			int x;
			scanf("%d", &x);
			heap.erase(v[x]);
		}
		else
		{
			printf("%d\n", *heap.begin());
		}
	}

	return 0;