#include<fstream>

using namespace std;

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

int ordonare(int *v, int i, int j)
{
	int piv = rand() % (i + j - 1) + i;
	while (i <= j) {
		while (v[i] < v[piv]) i++;
		while (v[j] > v[piv]) j--;
		if (i <= j) {
			int aux = v[i];
			v[i] = v[j];
			v[j] = aux;
			i++; j--;
		}
	}
	return i;
}
void quicksort(int* a, int l, int r)
{
	if (l >= r) return;
	int i = ordonare(a, l, r);
	quicksort(a, l, i - 1);
	quicksort(a, i, r);
}
int main()
{
	int n, *v;
	f >> n;
	v = (int*)malloc((n + 2) * sizeof(int));
	for (int i = 1; i <= n; i++) {
		f >> v[i];
	}
	quicksort(v, 1, n);
	for (int i = 1; i <= n; i++)
		g << v[i] << " ";
}