#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n,tip,val,V[200009];
set < int > heap;
int main()
{
    f >> n;
    for(int nr=0, i=1; i<=n; i++)
    {
        f >> tip;
        if(tip == 1)
        {
            f >> val;
            V[++nr] = val;
            heap.insert(val);
        }
        else if(tip == 2)
        {
            f >> val;
            heap.erase(V[val]);
        }
        else
        {
            g << *heap.begin() << '\n';
        }
    }
    g.close();
    return 0;
}