#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int heap[10000];
int main(){
	int n, t;
	cin >> n;
	for(int i = 1; i <= n; ++i){
		int op;
		cin >> op;
		if(op == 1){
			int x;
			cin >> x;
			heap[t] = x;
			++t; 
			sort(heap, heap + t, greater<int>());
		}
		else if(op == 2) cout << heap[t - 1];
		else --t;
	}
	return 0;
}