#include <stdio.h>
#include <stdlib.h>
#define N 200000

int h[N+1], v[N+1], poz[N+1];

void schimba(int h[], int poz[], int p1, int p2)
{
    int aux = h[p1];
    h[p1] = h[p2];
    h[p2] = aux;
    poz[h[p1]] = p1;
    poz[h[p2]] = p2;
}

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

void coboara(int h[], int v[], int poz[], int nh, int p)
{
    int fs = 2 * p, fd = 2 * p + 1, pmin = p;
    if (fs <= nh && v[h[fs]] < v[h[pmin]])
    {
        pmin = fs;
    }
    if (fd <= nh && v[h[fd]] < v[h[pmin]])
    {
        pmin = fd;
    }
    if (pmin != p)
    {
        schimba(h, poz, pmin, p);
        coboara(h, v, poz, nh, pmin);
    }
}

void adauga(int h[], int v[], int poz[], int *pnh, int val)
{
    (*pnh)++;
    h[*pnh] = val;
    poz[h[*pnh]] = *pnh;
    urca(h, v, poz, *pnh);
}

void sterge(int h[], int v[], int poz[], int *pnh, int p)
{
    h[p] = h[*pnh];
    poz[h[p]] = p;
    (*pnh)--;
    if (*pnh < p)
    {
        return;
    }
    urca(h, v, poz, p);
    coboara(h, v, poz, *pnh, p);
}

int main()
{
    FILE *in, *out;
    in = fopen("heapuri.in", "r");
    out = fopen("heapuri.out", "w");
    int n = 0, nh = 0, nrop;
    fscanf(in, "%d", &nrop);
    for (int i = 1; i <= nrop; i++)
    {
        int tip;
        fscanf(in, "%d", &tip);
        if (tip == 1)
        {
            fscanf(in, "%d", &v[++n]);
            adauga(h, v, poz, &nh, n);
        }
        else if (tip == 2)
        {
            int p;
            fscanf(in, "%d", &p);
            sterge(h, v, poz, &nh, poz[p]);
        }
        else///tip == 3
        {
            fprintf(out, "%d\n", v[h[1]]);
        }
    }
    fclose(in);
    fclose(out);
    return 0;
}