#include <fstream>
#include <set>
#include <vector>
#define In "heapuri.in"
#define Out "heapuri.out"
using namespace std;
vector< int >v;
set < int > H;
set < int > ::iterator it;
int main()
{
    int n,op,x;
    ifstream f(In);
    ofstream g(Out);
    f>>n;
    while(n--)
    {
        f>>op;
        if(op==3)
        {
            it = H.begin();
            g<<*it<<"\n";//afisez minimul
        }
        else
        {
            f>>x;
            if(op==1)
            {
                H.insert(x);//inserez pe x in heap
                v.push_back(x);
            }
            else
                H.erase(v[x-1]);//sterg al x-lea element intrat in ordine cronologica
        }
    }
    f.close();
    g.close();
    return 0;
}