#include <iostream>
#include <fstream>

using namespace std;
	
int n, v[500005];

int main()
{
	ifstream f("algsort.in");
	ofstream g("algsort.out");
	f >> n;
	for (int i = 1;i <= n;i++)
		f >> v[i];
	f.close();

	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
			if (v[i] > v[j])
			{
				swap(v[i], v[j]);
			}

	for (int i = 1;i <= n;i++)
		g << v[i] << " ";
	g << "\n";

	g.close();

	return 0;
}