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

multiset<int>p;
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);
            switch(c){
                case 1: scanf("%d",&x); v[++n]=x; p.insert(v[n]); break;
                case 2: scanf("%d",&x); it=p.find(v[x]); p.erase(it); break;
                case 3: printf("%d\n",*p.begin()); break;
            }
        }
    return 0;
}