#include <stdio.h>
void merge(int arr[], int l, int mid, int r)
{

    int i = l, j = mid + 1, k = l, output[1000];
    while (i <= mid && j <= r)
    {
        if (arr[i] < arr[j])
        {
            output[k] = arr[i];
            k++;
            i++;
        }
        else
        {
            output[k] = arr[j];
            j++;
            k++;
        }
    }
    while (i <= mid || j <= r)
    {
        if (i <= mid)
        {
            output[k] = arr[i];
            k++;
            i++;
        }
        else
        {
            output[k] = arr[j];
            j++;
            k++;
        }
    }
    for (int i = l; i < k; i++)
    {
        arr[i] = output[i];
    }
}
void mergeSort(int arr[], int l, int r)
{
    if (l < r)
    {
        int mid = (l + r) / 2;
        mergeSort(arr, l, mid);
        mergeSort(arr, mid + 1, r);
        merge(arr, l, mid, r);
    }
}
int main()
{
    int n;
    scanf("%d", &n);
    int a[n];
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    mergeSort(a, 0, n - 1);
    for (int i = 0; i < n; i++)
    {
        printf("%d ", a[i]);
    }
}