#include<fstream>
#include<algorithm>

using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");

int j,i,n,a[500005];

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