#include <iostream>
#include <cstdio>
using namespace std;
const int NMAX = 200001;
int H[NMAX][2],marime;
int nod_poz[NMAX];
/*
    H[i][0] = val
    H[i][0] = al catelea element este
    nod_poz[i] = elementul introdus al i - lea se afla in heap pe poz nod[i]
*/
int father(int nod){
    return nod/2;
}
int left_son(int nod){
    return 2*nod;
}
int right_son(int nod){
    return 2*nod + 1;
}
/// !!! tinem un min - heap

void up(int nod){
    int aux;
    while(nod > 1 && H[nod][0] < H[father(nod)][0]){
        aux = H[nod][0];
        H[nod][0] = H[father(nod)][0];
        H[father(nod)][0] = aux;

        aux = H[nod][1];
        H[nod][1] = H[father(nod)][1];
        H[father(nod)][1] = aux;

        aux = nod_poz[H[nod][1]];
        nod_poz[H[nod][1]] = nod_poz[H[father(nod)][1]];
        nod_poz[H[father(nod)][1]] = aux;

        nod = father(nod);
    }
}
void cerne(int nod){
    int son, aux;
    do{
        son = 0;
        if(left_son(nod) <= marime && H[nod][0] > H[left_son(nod)][0])
            son = left_son(nod);
        if(right_son(nod) <= marime && H[left_son(nod)][0] > H[right_son(nod)][0])
            son = right_son(nod);
        if(son){
            aux = H[nod][0];
            H[nod][0] = H[son][0];
            H[son][0] = aux;

            aux = H[nod][1];
            H[nod][1] = H[son][1];
            H[son][1] = aux;

            aux = nod_poz[H[nod][1]];
            nod_poz[H[son][1]] = nod_poz[H[son][1]];
            nod_poz[H[son][1]] = aux;
        }
        nod = son;
    }while(son);
}
void insert_heap(int x, int ord){
    marime ++;
    nod_poz[ord] = marime;
    H[marime][0] = x;
    H[marime][1] = marime;
    up(marime);
}
void delete_heap(int ord){
    int poz = nod_poz[ord];
    H[poz][0] = H[marime][0];
    H[poz][1] = H[marime][1];
    marime --;
    if(poz > 1 && H[poz][0] < H[father(poz)][0])
        up(poz);
    else
        cerne(poz);
}
int main()
{
    FILE *fin, *fout;
    int i,tip,x,n;
    fin=fopen("heapuri.in","r");
    fout=fopen("heapuri.out","w");
    fscanf(fin,"%d",&n);
    for(i=1;i<=n;i++){
        fscanf(fin,"%d",&tip);
        if(tip == 1){
            fscanf(fin,"%d",&x);
            insert_heap(x,i);
        }
        else if(tip == 2){
            fscanf(fin,"%d",&x);
            delete_heap(x);
        }
        else
            fprintf(fout,"%d\n",H[1][0]);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}