#include <fstream>

using namespace std;

const int N = 2e5;

int h[N], v[N], poz[N], nh, nv;

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

int tata(int p)
{
    return ((p - 1) / 2);
}

int fiu_stang(int p)
{
    return (2 * p + 1);
}

int fiu_drept(int p)
{
    return (2 * p + 2);
}

void urca(int p)
{
    while (p > 0 && v[h[p]] < v[h[tata(p)]])
    {
        schimba(p, tata(p));
        p = tata(p);
    }
}

void coboara(int p)
{
    int fs = fiu_stang(p), fd = fiu_drept(p), optim = p;
    if (fs < nh && v[h[fs]] < v[h[optim]])
    {
        optim = fs;
    }
    if (fd < nh && v[h[fd]] < v[h[optim]])
    {
        optim = fd;
    }
    if (optim != p)
    {
        schimba(optim, p);
        coboara(optim);
    }
}

void adauga(int pv)
{
    h[nh] = pv;
    poz[h[nh]] = nh;
    nh++;
    urca(nh - 1);
}

void sterge(int ph)
{
    if (ph == nh - 1)
    {
        nh--;
        return;
    }
    schimba(ph, nh - 1);
    nh--;
    urca(ph);
    coboara(ph);
}

int main()
{
    ifstream in("heapuri.in");
    ofstream out("heapuri.out");
    int nop;
    in >> nop;
    nh = nv = 0;
    for (int i = 0; i < nop; i++)
    {
        int tip;
        in >> tip;
        if (tip == 1)
        {
            in >> v[nv++];
            adauga(nv - 1);
        }
        else if (tip == 2)
        {
            int pv;
            in >> pv;
            pv--;
            sterge(poz[pv]);
        }
        else
        {
            out << v[h[0]] << "\n";
        }
    }
    in.close();
    out.close();
    return 0;
}