#include <stdio.h>
#include <stdlib.h>

#define MAX_N 200000
#define MAX_VAL 1000000000

typedef struct
{
    int *data;
    int dimensiune;
    int capacitate;
} MinHeap;

MinHeap *newHeap(int capacitate)
{
    MinHeap *heap = (MinHeap *)malloc(sizeof(MinHeap));
    heap->data = (int *)malloc(capacitate * sizeof(int));
    heap->dimensiune = 0;
    heap->capacitate = capacitate;
    return heap;
}

void swap(int *a, int *b)
{
    int temp = *a;
    *a = *b;
    *b = temp;
}

void adaugaInHeap(MinHeap *heap, int index)
{
    int parinte = (index - 1) / 2;
    if (index > 0 && heap->data[index] < heap->data[parinte])
    {
        swap(&heap->data[index], &heap->data[parinte]);
        adaugaInHeap(heap, parinte);
    }
}

void eliminaDinHeap(MinHeap *heap, int index)
{
    int min = index;
    int stanga = 2 * index + 1;
    int dreapta = 2 * index + 2;

    if (stanga < heap->dimensiune && heap->data[stanga] < heap->data[min])
    {
        min = stanga;
    }
    if (dreapta < heap->dimensiune && heap->data[dreapta] < heap->data[min])
    {
        min = dreapta;
    }
    if (min != index)
    {
        swap(&heap->data[index], &heap->data[min]);
        eliminaDinHeap(heap, min);
    }
}

void insereazaInHeap(MinHeap *heap, int valoare)
{
    if (heap->dimensiune == heap->capacitate)
    {
        heap->capacitate *= 2;
        heap->data = (int *)realloc(heap->data, heap->capacitate * sizeof(int));
    }
    heap->data[heap->dimensiune] = valoare;
    adaugaInHeap(heap, heap->dimensiune);
    heap->dimensiune++;
}

int getMinim(MinHeap *heap)
{
    if (heap->dimensiune == 0)
    {
        return -1;
    }
    int min = heap->data[0];
    heap->data[0] = heap->data[heap->dimensiune - 1];
    heap->dimensiune--;
    eliminaDinHeap(heap, 0);
    return min;
}

int main()
{
    FILE *inputFile, *outputFile;
    int N, op, x;
    MinHeap *heap = newHeap(MAX_N);

    inputFile = fopen("heapuri.in", "r");
    outputFile = fopen("heapuri.out", "w");

    fscanf(inputFile, "%d", &N);

    for (int i = 0; i < N; i++)
    {
        fscanf(inputFile, "%d", &op);
        if (op == 1)
        {
            fscanf(inputFile, "%d", &x);
            insereazaInHeap(heap, x);
        }
        else if (op == 2)
        {
            fscanf(inputFile, "%d", &x);
            for (int j = 0; j < heap->dimensiune; j++)
            {
                if (heap->data[j] == x)
                {
                    heap->data[j] = -1;
                    adaugaInHeap(heap, j);
                    break;
                }
            }
        }
        else if (op == 3)
        {
            for (int j = 0; j < heap->dimensiune; j++)
            {
                if (heap->data[j] != -1)
                {
                    fprintf(outputFile, "%d\n", heap->data[j]);
                    break;
                }
            }
        }
    }
    fclose(inputFile);
    fclose(outputFile);
    free(heap->data);
    free(heap);
    return 0;
}