#include <cstdio>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include<bitset>
#include <map>
#include <cstring>
#include <algorithm>
#define NMAX 100003
#define MOD 9917

using namespace std;

int n,k;
int v[NMAX];
multiset<int> heap;

FILE* fin, * fout;

int main()
{
	fin = fopen("heapuri.in", "r");
	fout = fopen("heapuri.out", "w");

	fscanf(fin, "%d", &n);
	k = 0;
	for (int i = 1; i <= n; i++)
	{
		int cer;
		fscanf(fin, "%d", &cer);
		if (cer==1)
		{
			int x;
			fscanf(fin, "%d", &x);
			v[++k] = x;
			heap.insert(x);
		}
		else if(cer==2) {
			int x;
			fscanf(fin, "%d", &x);
			heap.erase(v[x]);
		}
		else {
			fprintf(fout, "%d\n", *heap.begin());
		}
	}
	return 0;
}