#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[500001],n,i;

void qs(int v[], int l, int r)
{
	int i,j,tmp,pivot;
	i=l;
	j=r;
	pivot=v[(l+r)/2];
	while (i<=j)
	{
		while (v[i]<pivot)
			i++;
		while (v[j]>pivot)
			j--;
		if (i<=j)
		{
			tmp=v[i];
			v[i]=v[j];
			v[j]=tmp;
			i++;
			j--;
		}
	}
	if (l<j)
		qs(v, l, j);
	if (i< r)
		qs(v, i, r);
}

int main()
{
	f>>n;
	for (i=1;i<=n;i++)
		f>>v[i];
	qs(v, 1, n);
	for (i=1;i<=n;i++)
		g<<v[i]<<" ";
	f.close();
	g.close();
	return 0;
}