#include <fstream>
#include <vector>
#include <set>


using namespace std;
int n, x, y, val;
vector <int> v;
set <int> heap;

ifstream f("heapuri.in");
ofstream g("heapuri.out");


void adaugare(int x)
{
    heap.insert(x);
    v.push_back(x);
}

void stergere(int x)
{
    val = v[x-1];
    heap.erase(val);
}

int minim(set <int> heap)
{
    return *heap.begin();
}

int main()
{

    f>>n;
    while(n)
    {
        f>>x;
        n--;
        switch(x)
        {
        case 1:
            {
                f>>y;
                adaugare(y);
                break;

            }

        case 2:
            {
                f>>y;
                stergere(y);
                break;


            }
        case 3:
            {

                g<<minim(heap)<<endl;
                break;

            }



        }
    }

    f.close();
    g.close();

}