#include <iostream>
#include <random>
#include <fstream>
#include <stack>
#include <bitset>
#include <set>
using namespace std;

ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int a[200005], k;
multiset <int> M;
int main() 
{
    int n;
    fin >> n;
    for (int i = 1; i <= n; i++)
    {
        int q;
        fin >> q;
        if (q == 1)
        {
            int x;
            fin >> x;
            M.insert(x);
            a[++k] = x;
        }
        else if (q == 2)
        {
            int x;
            fin >> x;
            M.erase(M.find(a[x]));
        }
        else
            fout << *M.begin() << "\n";
    }
    return 0;
}