#include <iostream>
#include <fstream>
#include <deque>
#include <set>

#define MAX 2000005

using namespace std;

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

set<int> Heap;

int poz[MAX], k;

int main() {
	int n;
	fin >> n;

	int cod, nr;
	for (int i = 0; i < n; ++i) {
		fin >> cod;
		if (cod == 1) {
			fin >> nr;
			Heap.insert(nr);
			poz[++k] = nr;
		}
		if (cod == 2) {
			fin >> nr;
			Heap.erase(poz[nr]);
		}
		if (cod == 3) {
			fout << *Heap.begin() << "\n";
		}
	}

	return 0;
}