#include <fstream>

using namespace std;

const int N = 500000;
int v[N], n, aux[N];

void interclasare(int v[], int st, int dr)
{
	int m = (st + dr) / 2;
	int i = st, j = m + 1, k = st;
	while (i <= m && j <= dr)
	{
		if (v[i] <= v[j])
			aux[k ++] = v[i ++];
		else aux[k ++] = v[j ++];
	}
	while (i <= m)
	{
		aux[k ++] = v[i ++];
	}
	while (j <= dr)
	{
		aux[k ++] = v[j ++];
	}
	for (k = st; k <= dr; k ++)
	{
		v[k] = aux[k];
	}
}
void ms(int v[], int st, int dr)
{
	if (st == dr)
		return;
	
	int m = (st + dr) / 2;
	ms(v, st, m);
	ms(v, m + 1, dr);

	interclasare(v, st, dr);
}
int main()
{
	ifstream in("algosort.in");
	ofstream out("algosort.out");

	in >> n;
	for (int i = 0; i < n; i ++)
		in >> v[i];
	in.close();

	ms(v, 0, n - 1);

	for (int i = 0; i < n; i ++)
		out << v[i] << ' ';
	out.close();

	return 0;
}