#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int s[10000],n,i;
int cmp(const void *a,const void *b)
{
     return(*(int *)a-*(int *)b);//ÉýÐò£»b-a½µÐò
}
int main()
{
    scanf("%d",&n);
    for(i=0;i<n;i++)
	    scanf("%d",&s[i]);
    qsort(s,n,sizeof(s[0]),cmp);
    for(i=0;i<n;i++)
	    printf("%d ",s[i]);
  printf("\n");
    return 0;
}

/**************************************************************
	Problem: 2172
	User: admin
	Language: C
	Result: Accepted
	Time:12 ms
	Memory:1184 kb
****************************************************************/