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

using namespace std;

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

set <int> st;

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