=====================================================

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

#define MAX 1000

int loads[MAX];
int count = 0;
int lastProcessed = -1;

void sortLoads() {
    for (int i = 0; i < count - 1; i++) {
        for (int j = i + 1; j < count; j++) {
            if (loads[i] > loads[j]) {
                int temp = loads[i];
                loads[i] = loads[j];
                loads[j] = temp;
            }
        }
    }
}

int main() {
    int N;
    if (scanf("%d", &N) != 1 || N < 1 || N > MAX) {
        printf("Invalid input\n");
        return 0;
    }

    for (int i = 0; i < N; i++) {
        int op, val;
        if (scanf("%d", &op) != 1 || op < 1 || op > 3) {
            printf("Invalid input\n");
            return 0;
        }

        if (op == 1) {
            if (scanf("%d", &val) != 1 || val < 0 || val > 10000) {
                printf("Invalid input\n");
                return 0;
            }
            loads[count++] = val;
        } else if (op == 2) {
            int found = 0;
            int minIndex = -1;
            int minValue = 10001;

            for (int j = 0; j < count; j++) {
                if (loads[j] >= lastProcessed && loads[j] < minValue) {
                    minValue = loads[j];
                    minIndex = j;
                    found = 1;
                }
            }

            if (found) {
                printf("%d\n", minValue);
                lastProcessed = minValue;

                // Remove processed packet
                for (int j = minIndex; j < count - 1; j++) {
                    loads[j] = loads[j + 1];
                }
                count--;
            }
        } else if (op == 3) {
            if (count == 0) {
                printf("0\n");
            } else {
                sortLoads();
                for (int j = 0; j < count; j++) {
                    printf("%d ", loads[j]);
                }
                printf("\n");
            }
        }
    }

    return 0;
}