///#include <iostream>
#include <fstream>
#include <queue>
#include <set>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int n,op,x,p,fr[200001],nr;

multiset<int>s;

int main()
{
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>op;
        if(op==1){
           cin>>x;
           s.insert(x);
           fr[++nr]=x;
        }else if(op==3){
          cout<<*s.begin()<<"\n";
        }else{
            cin>>p;
            s.erase(s.find(fr[p]));
        }
    }
    return 0;
}