RRRRRRRRRRRRRRRRRRRR

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

enum {N = 9000005};

int lower_case(char c) {
    return 'a' <= c && c <= 'z';
}

int upper_case(char c) {
    return 'A' <= c && c <= 'Z';
}

int char_comp(char c1, char c2) {
    if (c1 == c2)
        return 0;
    if (lower_case(c1) && upper_case(c2))
        return -1;
    if (upper_case(c1) && lower_case(c2))
        return 1;
    if (c1 < c2)
        return -1;
    return 1;
}

int comp(const void *s1, const void *s2) {
    int i = 0;
    while (1) {
        char c1 = *(*(char **)(s1) + i);
        char c2 = *(*(char **)(s2) + i);
        if (!c1 || !c2)
            break;
        int cmp = char_comp(c1, c2);
        if (cmp == 0) {
            ++i;
            continue;
        }
        return cmp;
    }
    char c1 = *(*(char **)(s1) + i);
    char c2 = *(*(char **)(s2) + i);
    if (!c1 && !c2)
        return 0;
    if (!c1)
        return -1;
    return 1;
}

int main(void) {
    int n;
    scanf("%d\n", &n);

    char **a = malloc(n * sizeof(char*));

    for (int i = 0; i < n; ++i) {
        char c = '*';
        char *s = malloc(1);
        int sz = 0, mem_sz = 1;
        while (1) {
            c = getchar();
            if (c == '\n')
                break;
            if (sz + 1 >= mem_sz) {
                mem_sz *= 2;
                char *s0 = realloc(s, mem_sz);
                s = s0;
            }
            s[sz] = c;
            ++sz;
        }


        if (sz + 1 >= mem_sz) {
            mem_sz += 1;
            char *s0 = realloc(s, mem_sz);
            s = s0;
        }
        s[sz] = '\0';
        a[i] = realloc(s, sz + 1);
    }

    qsort(a, n, sizeof(char*), comp);

    for (int i = 0; i < n; ++i) {
        printf("%s\n", a[i]);
    }
    free(a);

    return 0;
}