#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define oo 2000000
#define MOD 1000000007
using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
multiset<int>m;
int n, op, x;
int v[200005],k;
int main()
{
	fin >> n;
	while (n--)
	{
		fin >> op;
		if (op == 1)
		{
			fin >> x;
			v[++k] = x;
			m.insert(x);
		}
		else if (op == 2)
		{
			fin >> x;
			m.erase(m.find(v[x]));
		}
		else if(op==3)
		{
			fout <<*m.begin()<<"\n";
		}
	}


}