#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int w[500001],v[500001];
void mergesort(int left,int right)
{
    if (left<right)
{
    int mid=(left+right)/2;
    mergesort(left,mid);
    mergesort(mid+1,right);
    int k=0,i=left,j=mid+1;
    while(i<=mid && j<=right)
    {
        if(v[i]<v[j])
            w[++k]=v[i++];
        else
            w[++k]=v[j++];

    }
    while(i<=mid)
        w[++k]=v[i++];
    while(j<=right)
        w[++k]=v[j++];
    for(i=left,j=1;i<=right;i++,j++)
        v[i]=w[j];
}
}
int main()
{

    int i,n;
    f>>n;
    for (i=1;i<=n;i++)
        f>>v[i];
    mergesort(1,n);
    for (i=1;i<=n;i++)
        g<<v[i]<<" ";
    return 0;
}