//counting sort
#include <iostream>
int a[1000],result[1000],key[1000];
using namespace std;
int main ()
{
	int n,middlelen;
	cin >> n;
	for(int i=1;i<=n;++i)
	{
		cin >> a[i];
		++key[a[i]];
	}
	for(int i=1;i<=n;++i)
	{
		if(key[i]>0)
		{
			key[i]+=key[i-1];
		}
	}
	for(int i=1;i<=n;++i)
	{
		middlelen = key[a[i]]-1;
		result[middlelen]=a[i];
	}
	for(int i=1;i<=n;++i)
	{
		cout << result[i] << ' ';
	}
}