#include <iostream>
#include <fstream>
#include <set>
using namespace std;
int v[200002],i,n,op,x,k=0;
multiset<int>heap;
int main()
{
    ifstream f("heapuri.in");
    ofstream g("heapuri.out");
    f>>n;
    for (i=0;i<n;i++)
    {
        f>>op;
        if (op==1)
        {
            f>>x;
            heap.insert(x);
            v[k]=x;
            k++;
        }
        if (op==2)
        {
            f>>x;
            heap.erase(heap.find(v[x-1]));
        }
        if (op==3)
        {
            g<<*heap.begin()<<"\n";
        }
    }
    f.close();
    g.close();
    return 0;
}