#include <stdio.h>
#include <stdlib.h>
#define N 500000

int v[N], aux[N];

void merge(int v[], int st, int dr)
{
    int m = (st + dr) / 2, i = st, j = m + 1, k = st;
    while (i <= m && j <= dr)
    {
        if (v[i] <= v[j])
        {
            aux[k++] = v[i++];
        }
        else//stim ca v[i] > v[j]
        {
            aux[k++] = v[j++];
        }
    }
    while (i <= m)
    {
        aux[k++] = v[i++];
    }
    while (j <= dr)
    {
        aux[k++] = v[j++];
    }
    for (int i = st; i <= dr; i++)
    {
        v[i] = aux[i];
    }
}

void merge_sort(int v[], int st, int dr)
{
    if (st == dr)
    {
        return;
    }
    int m = (st + dr) / 2;
    merge_sort(v, st, m);
    merge_sort(v, m + 1, dr);
    merge(v, st, dr);
}

int main()
{
    FILE *in, *out;
    in = fopen("algsort.in", "r");
    out = fopen("algsort.out", "w");
    int n;
    fscanf(in, "%d", &n);
    for (int i = 0; i < n; i++)
    {
        fscanf(in, "%d", &v[i]);
    }
    merge_sort(v, 0, n - 1);
    for (int i = 0; i < n; i++)
    {
        fprintf(out, "%d ", v[i]);
    }
    fprintf(out, "\n");
    fclose(in);
    fclose(out);
    return 0;
}