#include<cstdio>
int i,j,n,v[500010];
void qsort(int left,int right, int a[])
{
int i=left,j=right;
int tmp;
int pivot=a[(left+right)/2];
while(i<=j)
{
	while(a[i]<pivot)
		i++;
	while(a[j]>pivot)
		j--;
	if(i<=j)
	{
		tmp=a[i];
		a[i]=a[j];
		a[j]=tmp;
		i++;
		j--;
	}



}
if(left<j)
	qsort(left,j,a);
if(i<right)
	qsort(i,right,a);

}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);

qsort(1,n,v);
for(i=1;i<=n;i++)
	printf("%d ",v[i]);
printf("\n");
	return 0;
}