#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

int a[500'005], i, n;

int main()
{
	f >> n;
	for (i = 1; i <= n; i++)
		f >> a[i];

	int j;
	for (i = 1; i < n; 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] << " ";

    f.close();
    g.close();
    return 0;
}