#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <algorithm>
#include <utility>

using namespace std;

set <int> heap;

unsigned enter[200001];

int main()
{
    ifstream f("heapuri.in");
    ofstream g("heapuri.out");
    unsigned t;
    int r,i,x=1,n;
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>t;
        if(t==3)g<<*heap.begin()<<'\n';
        else if(t==2)
        {
            f>>r;
            heap.erase(enter[r]);
        }
        else if(t==1)
        {
            f>>r;
            heap.insert(r);
            enter[x++]=r;
        }
    }
    return 0;
}