#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

void pushUp (int heap[], int poz) {
    if (poz == 0)
        return;
    int indice = (poz - 1) / 2;
    while (heap[indice] > heap[poz]) {
        int aux;
        aux = heap[indice];
        heap[indice] = heap[poz];
        heap[poz] = aux;
        poz = indice;
        if (poz == 0)
            return;
        indice = (poz - 1) / 2;
    }
}

void pushDown (int heap[], int poz, int dimVect) {
    int indice;
    if (2 * poz + 2 > dimVect && 2 * poz + 1 > dimVect)
            return;
        else if (2 * poz + 2 > dimVect && 2 * poz + 1 <= dimVect)
            indice = 2 * poz + 1;
        else if (2 * poz + 2 <= dimVect && 2 * poz + 1 > dimVect)
            indice = 2 * poz + 2;
        else {
            if (heap[2 * poz + 2] > heap[2 * poz + 1])
                indice = 2 * poz + 1;
            else
                indice = 2 * poz + 2;
        }
    while (heap[poz] > heap[indice]) {
        int aux;
        aux = heap[indice];
        heap[indice] = heap[poz];
        heap[poz] = aux;
        poz = indice;
        if (2 * poz + 2 > dimVect && 2 * poz + 1 > dimVect)
            return;
        else if (2 * poz + 2 > dimVect && 2 * poz + 1 <= dimVect)
            indice = 2 * poz + 1;
        else if (2 * poz + 2 <= dimVect && 2 * poz + 1 > dimVect)
            indice = 2 * poz + 2;
        else {
            if (heap[2 * poz + 2] > heap[2 * poz + 1])
                indice = 2 * poz + 1;
            else
                indice = 2 * poz + 2;
        }
    }
}

int main() {
    vector<int> numbers;
    ifstream in;
    in.open("heapuri.in");
    ofstream out;
    out.open("heapuri.out");
    int n, i, j, Op, x, *heap, dim = 0;
    in >> n;
    numbers.reserve(n);
    heap = new int[n];
    for (i = 0; i < n; i++) {
        in >> Op;
        if (Op == 1) {
            in >> x;
            heap[dim] = x;
            pushUp(heap,dim);
            dim++;
            numbers.push_back(x);
        }
        else if (Op == 2) {
            in >> x;
            for (j = 0; j < dim; j++)
                if (heap[j] == numbers[x - 1]) {
                    dim--;
                    heap[j] = heap[dim];
                    pushDown(heap,j,dim);
                    break;
            }
        }
        else {
            out << heap[0] << "\n";
        }
    }
    in.close();
    out.close();
    return 0;
}