#include<iostream>
#include<cstdio>
using namespace std;
void qsort(int low,int high);
int a[10001];
int main()
{
	int n;scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",a[i]);
	}
	qsort(1,n);
	for(int i=1;i<=n;i++)
	{
	     if(i==n) printf("%d ",a[n]);
		else printf("%d ",a[i]);
	}
	return 0;
}
void qsort(int low,int high)
{
	int i=low,j=high,key=a[(low+high)/2];
	while(i<=j)
	{
		while(a[i]<key) i++;
		while(a[j]>key) j--;
		if(i<=j)
		{
			swap(a[i],a[j]);
			i++;j--;
		}
	}
	if(low<j) qsort(low ,j);
	if(i<high) qsort(i,high);
}
//谢谢你呀!