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


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