#include <bits/stdc++.h>
#define N 500005
using namespace std;

    int v[N], tmp[N], n, m;

    ifstream fin("algsort.in");
    ofstream fout("algsort.out");

void MergeSort(int v[], int st, int dr)
{
    if(st < dr)
    {
        int m = (st + dr) / 2;
        MergeSort(v, st , m);
        MergeSort(v, m + 1 , dr);

        int i = st, j = m + 1, k = 0;
        while( i <= m && j <= dr )
            if( v[i] < v[j])
                tmp[++k] = v[i++];
            else
                tmp[++k] = v[j++];
        while(i <= m)
            tmp[++k] = v[i++];
        while(j <= dr)
            tmp[++k] = v[j++];
        for(i = st , j = 1 ; i <= dr ; i ++ , j ++)
            v[i] = tmp[j];
    }
}

int main()
{
    fin >> n;
    for(int i=1;i<=n;++i)
        fin >>v[i];

    MergeSort(v,1,n);

    for(int i=1;i<=n;++i)
        fout <<v[i] << " ";

    return 0;
}