#include <stdio.h>
#include <stdlib.h>
int compare (const void *p,const void *q)
{
    int x=*(int *)p; 
	int y=*(int *)q;
     if (x<y)
	  return -1;
     if (x>y)
         return 1;
return 0;
}
int cbin(int x,int v[10000],int n)
{
    int m,st=1,dr=n;
    while (st!=dr)
    {
        m=st/2-dr/2+dr;
        if (v[m]==x)
             return m;
        if (v[m]>x)
			dr=m;
        else
            st=m+1;
    }
    return 0;
}
int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
      int n,v[500005],i;
      scanf("%d",&n);
      for (i=1; i<=n; i++)
             scanf("%d",&v[i]);
	qsort(v+1,n,sizeof(v[0]),compare);
	for (i=1; i<=n; i++)
		printf("%d ",v[i]);
    //  printf("%d",cbin(x,v,n));
	return 0;
}