#include <iostream>
#include <fstream>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;

multiset <int> h;
vector <int> v;

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

	int n, i, j, tip, val;

	f>>n;
	while(n--) {
		f>>tip;

		if(tip==3) {
			g<<*h.begin()<<"\n";
			continue;
		}
		f>>val;
		if(tip==1) {
			v.push_back(val);
			h.insert(val);
		}
		if(tip==2) h.erase(v[val-1]);
	}

	return 0;
}