#include <fstream>
#include <set>
#define nmax (int)(2e5+1)
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int q,poz[nmax],n,x,task;
multiset<int>s;
int main()
{
    cin>>q;
    while(q--){
        cin>>task;
        if(task==3){
            cout<<*s.begin()<<'\n';
            continue;
        }
        cin>>x;
        if(task==1){
            s.insert(x);
            poz[++n]=x;
        }else
            s.erase(s.find(poz[x]));
    }
    return 0;
}