#include <bits/stdc++.h>
using namespace std;
int q,ce,x,i;
multiset<int>st;
map<int,int>ma;
int main()
{
    ifstream cin ("heapuri.in");
    ofstream cout ("heapuri.out");
    cin>>q;
    while(q--)
    {
        cin>>ce;
        if(ce==1)
        {
            cin>>x;
            ++i;
            st.insert(x);
            ma[i]=x;
        }
        else if(ce==2)
        {
            cin>>x;
            x=ma[x];
            auto it=st.find(x);
            st.erase(it);
        }
        else cout<<*st.begin()<<'\n';
    }
    return 0;
}