#include<iostream>
#include<fstream>
int a[500000],c[500000],i,n;
void merges(unsigned st, unsigned dr)
{
	if (st == dr)return;
	unsigned  m = (st + dr) / 2;
	merges(st, m);
	merges(m + 1, dr);
	unsigned  j = st, i = m + 1, s = 0;
	while (j <= m || i <= dr)
	{
		if (j > m){ c[s++] = a[i++]; continue; }
		if (i > dr){ c[s++] = a[j++]; continue; }
		if (a[j] > a[i])c[s++] = a[i++];
		else c[s++] = a[j++];
	}
	for (j = st, i = 0; i < s; i++, j++)a[j] = c[i];
}
int main()
{


	std::ifstream f("algsort.in");
	f >> n;
	for (int i = 0; i < n; i++)f >> a[i];
	f.close();
	merges(0, n - 1);
	std::ofstream g("algsort.out");
	for (int i = 0; i < n; i++)g << a[i] << " ";
	g.close();
}