#include<cstdio>
int i,;
void sortare(int l, int r)
{
    int m,i,j,k;
    m==(l+r)/2;
    if(l==r)return;
    sortare( l, m );
    sortare( m + 1, r );
    i=l;
    j=m+1;
    k=l;
    while(i<=m||j<=r)
    {
        if(j>r||(i<=m&&a[i]<a[j]))
        {
            k++;i++;
            b[k]=a[i];
        }
        else
        {
            k++;j++;
            b[k]=a[j];
        }
    }
    for(k=l;k<=r;k++)
    {
        a[k]=b[k];
    }
}
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    sortare(1,n);
    for(i=1;i<=n;i++)
    {
        printf("%d ",a[i]);
    }
    return 0;
}