#include <set>
#include <queue>
#include <fstream>
#include <vector>
using namespace std;

priority_queue <int> pq;
set <int> rem;
vector <int> nr;
int i, j, op, n;

int main() {
	ifstream in("heapuri.in");
	ofstream out("heapuri.out");
	in >> n;
	while (n--) {
		in >> op;
		if (op == 1) {
			in >> i;
			nr.push_back(-1 * i);
			pq.push(-1 * i);
		}
		else if (op == 2) {
			in >> i;
			rem.insert(nr[i - 1]);
			while (rem.find(pq.top()) != rem.end()) {
				rem.erase(pq.top());
				pq.pop();
			}
		}
		else
			out << -1 * pq.top() << '\n';
	}
}