#include<fstream>
using namespace std;
int a[100],i,ok,n,aux,j;
int main()
{
	ifstream f("sort.in");
	ofstream g("sort.out");
	f>>n;
	for(i=1;i<=n;i++)
		f>>a[i];
	/*ok=0;
	while(ok==0)
	{
		ok=1;
		for(i=1;i<=n-1;i++)
			if(a[i]>a[i+1])
			{
				aux=a[i+1];
				a[i+1]=a[i];
				a[i]=aux;
				ok=0;
			}
	}
	
*/
	for(i=1;i<=n-1;i++)
		for(j=i+1;j<=n;j++)
			if(a[i]>a[j])
			{
				aux=a[j];
				a[j]=a[i];
				a[i]=aux;
			}
	
	
			
	for(i=1;i<=n;i++)
		g<<a[i]<<" ";
	return 0;
}