#include<fstream>
#include<algorithm>
using namespace std;

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

int N,v[500010];

void insertion_sort()
{
	int j;
	for (int i = 2;i <= N;++i)
	{
		j = i;
		while (j > 1 && v[j] < v[j - 1])
			swap(v[j], v[j - 1]), --j;
	}
}

int main()
{
	in >> N;
	for (int i = 1;i <= N;++i)
		in >> v[i];

	insertion_sort();

	for (int i = 1;i <= N;++i)
		out << v[i] << " ";
	
	return 0;
}