#include <fstream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set <int> s;
int i,n,x,y,v[10000001],k;
int main()
{
    fin>>n;
    for(i=1;i<=n;++i)
    {
        fin>>x;
        if(x==3)
{
    fout<<*s.begin()<<"\n";
}
else
{
fin>>y;
        if(x==1)
            {
                s.insert(y);
                v[++k]=y;
                }
        if(x==2)
            {
                s.erase(v[y]);
            }
}
    }
    return 0;
}