#include <stdio.h>
unsigned long n,m,a[100];
void interc(unsigned long l,unsigned long m,unsigned long r)
{
    unsigned long i,j,t,k,b[100];
    for(i=1; i<=r; i++)
     b[i]=a[i];
    i=l;
    j=m+1;
    k=l;
    while(i<=m && j<=r)
     if(b[i]>b[j])
       a[k++]=b[j++];
     else
       a[k++]=b[i++];
    for(t=i; t<=m; t++)
       a[k++]=b[t];
    for(t=j; t<=r; t++)
       a[k++]=b[t];
}
void mergesort(unsigned long l,unsigned long r)
{
    unsigned long m;
    if(l==r) return;
    m=(l+r)/2;
    mergesort(1,m);
    mergesort(m+1,r);
    interc(l,m,r);
}
int main()
{
   freopen("algsort.in","r",stdin);
   freopen("algsort.out","w",stdout);
   unsigned long i;
   scanf("%lu",&n);
   for(i=1; i<=n; i++) scanf("%lu",&a[i]);
   mergesort(1,n);
   for(i=1; i<=n; i++) printf("%lu ",a[i]);
   return 0;
}