#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int aux[500002];
void interclasare(int v[500002], int st, int dr)
{
    int m=(st+dr)/2;
    int i=st, j=m+1, k=st;
    while (i<=m&&j<=dr)
    {
        if (v[i]<=v[j])
            aux[k++]=v[i++];
        else 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[500002], int st, int dr)
{
    if (st==dr)
        return;
    int m=(st+dr)/2;
    ///g<<st<<" "<<dr<<endl;
    merge_sort(v, st, m);
    merge_sort(v, m+1, dr);
    interclasare(v, st, dr);
}
int main()
{
    int n, v[500002];
    f>>n;
    for (int i=1; i<=n; i++)
        f>>v[i];
    merge_sort(v, 1, n);
    for (int i=1; i<=n; i++)
        g<<v[i]<<" ";
    return 0;
}