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

using namespace std;

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

set<long long>Heap;

long long n,cod,x,nr=0;
int main()
{
    f>>n;
    long long v[n+1];

    while(n!=0){

        f>>cod;
        if(cod==1){
            f>>x;
            nr++;
            v[nr]=x;
            Heap.insert(x);
        }
        if(cod==2){
            f>>x;
            Heap.erase(v[x]);
        }
        if(cod==3){
            g<<*Heap.begin()<<"\n";
        }

        n--;
    }


    return 0;
}