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