#include<fstream>
#include<set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int nr, n, x, q, m[200002];
set<int> heap;
int main()
{
    f>>nr;
    while(nr>0)
    {
        f>>q;
        if(q==1)
        {
            f>>x;
            heap.insert(x);
            m[++n]=x;
        }
        if(q==2)
        {
            f>>x;
            heap.erase(heap.find(m[x]));
        }
        if(q==3)
            g<<*heap.begin()<<"\n";
        nr--;
    }
    return 0;
}