#include <iostream>
#include <fstream>
#include <set>

using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set<int> heap;
int n, k, op;

int main()
{


    f>>n;
    k=1;
    int v[n+1];

    for(int i=0;i<n;i++)
        {
            f>>op;

            switch(op){

                case 1:
                    {
                        //inserare
                        int y;
                        f>>y;

                        heap.insert(y);
                        v[k++]=y;
                        break;
                    }
                case 2:
                    {
                        //stergere
                        int poz;
                        f>>poz;

                        heap.erase(v[poz]);
                        break;
                    }
                case 3:
                    {
                        //afiseaza
                        g<<*heap.begin()<<"\n";
                    }
        }
    }

    return 0;
}