#include<iostream>
#include<fstream>
#define MAXN 200001
#define FIN "heapuri.in"
#define FOUT "heapuri.out"
#define in f
#define out g

using namespace std;

ifstream f(FIN);
ofstream g(FOUT);

int h[MAXN];
int p[MAXN];
int length;
int n;
int v[MAXN];

int swap(int firstPos, int secondPos)
{
    v[h[firstPos]] = secondPos;
    v[h[secondPos]] = firstPos;

    int aux = h[firstPos];
    h[firstPos] = h[secondPos];
    h[secondPos] = aux;

    return 0;
}

int insert(int value)
{
    length++;
    v[value] = length;
    h[length] = value;
    int position = length;
    while(h[position] <  h[position / 2] && position > 1)
    {
        swap(position, position / 2);
        position /= 2;
    }

    return 0;
}

int erase(int pos)
{
    swap(pos, length);
    length--;

    int position = pos;
    while((h[position] > h[2 * position] || h[position] > h[2 * position + 1]) && position <= length / 2)
    {
        int node = min(h[2 * position], h[2 * position + 1]);
        swap(v[h[node]], v[h[node / 2]]);
        position = v[h[node]];
    }

    return 0;
}

int getMax()
{
    return h[1];
}

int main()
{
    in >> n;

    int x, y;
    int index = 0;
    for(int i = 1; i <= n; i++)
    {
        in >> x;

        switch(x)
        {
            case 1:
                in >> y;
                index++;
                p[index] = y;
                insert(y);
                break;
            case 2:
                in >> y;
                erase(v[p[y]]);
                break;
            case 3:
                out << getMax() << "\n";
                break;
        }


    }

    return 0;
}