#include <bits/stdc++.h>
using namespace std;
#define nmax 50000
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n, arr[nmax];
void merge(int arr[], int l, int m, int r)
{
    int i, j, k;
    int n1 = m - l + 1;
    int n2 =  r - m;
    int left[n1], right[n2];
    for (i = 0; i < n1; i++)
        left[i] = arr[l + i];
    for (j = 0; j < n2; j++)
        right[j] = arr[m + 1+ j];
    i = 0;
    j = 0;
    k = l;
    while (i < n1 && j < n2){
        if (left[i] <= right[j]){
            arr[k] = left[i];
            i++;
        }
        else{
            arr[k] = right[j];
            j++;
        }
        k++;
    }
    while (i < n1){
        arr[k] = left[i];
        i++;
        k++;
    }
    while (j < n2){
        arr[k] = right[j];
        j++;
        k++;
    }
}
void mergeSort(int arr[], int l, int r)
{
    if (l < r){
        int m = l+(r-l)/2;
        mergeSort(arr, l, m);
        mergeSort(arr, m+1, r);
        merge(arr, l, m, r);
    }
}
int main()
{

    fin >> n;
    for(int i = 1; i <= n; ++i)
    {
        fin >> arr[i];
    }
    mergeSort(arr, 1, n);
    for(int i = 1; i <= n; ++i)
    {
        fout << arr[i] <<" ";
    }
    return 0;
}