#include <fstream>

using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
void mergesort(int a[],int st,int dr)
{
    if(st==dr)
        return;
    int m=(st+dr)/2;
    mergesort(a,st,m);
    mergesort(a,m+1,dr);
    int tmp[dr-st+2],i=st,j=m+1,k=0;
    while(i<=m && j<=dr)
        if(a[i]<a[j])
            tmp[++k]=a[i++];
        else
            tmp[++k]=a[j++];
    while(i<=m)
        tmp[++k]=a[i++];
    while(j<=dr)
        tmp[++k]=a[j++];
    for(i=st,j=1;i<=dr;i++,j++)
        a[i]=tmp[j];
}
int n,i,a[500011];
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
        f>>a[i];
    mergesort(a,1,n);
    for(i=1;i<=n;i++)
        g<<a[i]<<" ";
    return 0;
}