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

using namespace std;

ifstream f ("heapuri.in");
ofstream g ("heapuri.out");

const int NMAX = 200000 + 1;

int ord[NMAX];
set <int> s;

void adauga(int x) {
	s.insert(x);
}

void sterge(int x) {
	s.erase(s.find(ord[x]));
}

void minim() {
	g << (*s.begin()) << '\n';
}

int main() {
	int n, k, x, op;
	f >> n;
	k = 0;

	while (n--) {
		f >> op;
		if (op == 1) {
			f >> x;
			ord[++k] = x;
			adauga(x);
			continue;
		}
		if (op == 2) {
			f >> x;
			sterge(x);
			continue;
		}
		minim();
	}

	return 0;
}