#include <cstdio>
#include <algorithm>
#include <set>
#define nmax 200001
FILE *f,*g;
using namespace std;

set <int> H;

int main()
{
    f=fopen("heapuri.in","r");
    g=fopen("heapuri.out","w");
    int i,j,N,v[nmax],x,c,k=0;
    fscanf(f,"%d",&N);
    for(i=1 ; i<=N ; i++)
    {
        fscanf(f,"%d",&c);
        if(c == 1)
        {
            fscanf(f,"%d",&x);
            H.insert(x);
            v[++k] = x;
            continue;
        }
        if(c == 2)
        {
            fscanf(f,"%d",&x);
            H.erase(v[x]);
            continue;
        }
        set<int>::iterator it = H.begin();
        fprintf(g,"%d\n",*it);
    }
    fclose(f);
    fclose(g);
    return 0;
}