#include <iostream>
#include <fstream>

using namespace std;

void add(int heap[], int n_heap, int x, int ordine[], int A[], int &n_ord, int poz[]) {
    int k = n + 1;

    v[n + 1] = x;

    ordine[n_ord++] = x;
    poz[x] = n + 1;

    while (k > 1 && v[k] < v[k / 2]) {
        int aux = v[k];

        v[k] = v[k / 2];
        v[k / 2] = aux;

        poz[v[k]] /= k;
        poz[v[k / 2]] = k / 2;

        k /= 2;
    }
}

void del(int heap[], int n_heap, int nr, int ordine[], int &n_ord, int poz) {
    int poz[ordine[nr]] //pozitia
    while (poz < )
}

int minim(int heap[]) {
    return v[1];
}

int main()
{
    ifstream fin("heapuri.in");
    ofstream fout("heapuri.out");

    int heap[200000], ordine[200000], poz[200000], A[200000], n = 0, N, cod, x;

    for (int i = 0; i < N; i++) {
        fin >> cod;

        if (cod != 3) {
            fin >> x;
        }
    }

    fin.close();
    fout.close();

    return 0;
}