#include <stdio.h>
using namespace std;

int N, op, nrh, intrati, aux, intrat[200000], h[200000], poz_heap[200000];
//poz[i] = pozitia in heap a intratului cu nr i
//intrat[i] = valoarea intratului cu nr i
//h[i] = poz intratului cu nr i
void schimba(int p1, int p2){
    aux = h[p1];
    h[p1] = h[p2];
    h[p2] = aux;
}

void schimba_poz(int p1, int p2){
    aux = poz_heap[p1];
    poz_heap[p1] = poz_heap[p2];
    poz_heap[p2] = aux;
}

void urca(int p){
    while(p > 1 && intrat[h[p]] < intrat[h[p/2]]){
        schimba(p, p/2);
        schimba_poz(h[p], h[p/2]);
        p /= 2;
    }
}


void insereaza(int val){
    ++intrati; h[++nrh] = intrati;
    poz_heap[intrati] = nrh; intrat[intrati] = val;
    urca(nrh);
}

void coboara(int p){
    int fs = 2 * p, fd = 2 * p + 1, bun = p;
    if(fs <= nrh && intrat[h[fs]] < intrat[h[bun]]){
        bun = fs;
        schimba(p, fs);
        schimba_poz(h[p], h[fs]);
    }
    if(fd <= nrh && intrat[h[fd]] < intrat[h[p]]){
        bun = fd;
        schimba(p, fd);
        schimba_poz(h[p], h[fd]);
    }
    if(bun != p){
        coboara(bun);
    }
}

void elimina(int poz){
    schimba(poz, nrh--);
    schimba_poz(h[poz], h[nrh+1]);
    //poz_heap[h[nrh+1]] = 0;
   // h[nrh+1] = 0;
    urca(poz);
    coboara(poz);
}

int main(){
    freopen("heapuri.in", "r", stdin);
    freopen("heapuri.out", "w", stdout);

    int i, x;
    scanf("%d", &N);
    for(i = 1; i <= N; i++){
        scanf("%d", &op);
        switch(op){
            case 1:
                scanf("%d", &x);
                insereaza(x);
                break;
            case 2:
                scanf("%d", &x);
                elimina(poz_heap[x]);
                break;
            case 3:
                printf("%d\n", intrat[h[1]]);
                break;
        }
    }
}