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