#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> myheap;
int main(){
  int n,op,v[200001],k=1,x;
    f>>n;
    for(int i=1;i<=n;i++)
    {
        f>>op;
        if(op==1)
        {   //executam inserarea
            f>>x;
            myheap.insert(x);
            v[k]=x;
            k++;

        }
        else if(op==2)
        {  //executam stergerea
            f>>x;
            myheap.erase(v[x]);

        }
        else
        {   //afisam cel mai mic numar
            g<<*myheap.begin()<<"\n";
        }
    }
    f.close();
    g.close();
    return 0;

}