#include <cstdio>
#include <set>
#include <algorithm>
using namespace std;
#define MAX 200002

multiset<int>s;
multiset<int>::iterator it;
int v[MAX],n;

int main(){
    int m,c,x;
    freopen("heapuri.in","r",stdin);
    freopen("heapuri.out","w",stdout);
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d",&c);
            if(c==3)printf("%d\n",*s.begin()); else
            {
                scanf("%d",&x);
                if(c==1)
                {
                    v[++n]=x;
                    s.insert(x);
                } else {
                    it=s.find(v[x]);
                    s.erase(it);
                }
            }
        }
    return 0;
}