#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");

int main ()
{
	long n,i,swap;
	long long a[500001],aux;
	f>>n;
	for (i=1; i<=n; i++)
		f>>a[i];
	swap=1;
	while (swap)
	{
		swap=0;
		for (i=1; i<n; i++)
			if (a[i]>a[i+1])
			{
				aux=a[i];
				a[i]=a[i+1];
				a[i+1]=aux;
			swap=1;
			}
	}
	for (i=1; i<=n; i++)
		g<<a[i]<<" ";
	return 0;
}