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

using namespace std;

int n,op,x,m,a[200000],i;

priority_queue< int, vector<int>, greater<int> > coada;

set <int> st;

int main()
{
    ifstream f ("heapuri.in");
    ofstream g ("heapuri.out");
    f>>n;
    for (i=1;i<=n;i++)
    {
        f>>op>>x;
        if (op==1)
        {
            st.insert(x);
            m++;
            a[m]=x;
        }
        if (op==2)
        {
            st.erase(a[x]);
        }
        if (op==3)
        {
            g<<*st.begin()<<"\n";
        }
    }

    return 0;
}