#include<stdio.h>
#include<stdlib.h>

long i, j, n, a[500001];
FILE *fin, *fout;

int comp(const void *a, const void *b)
{
	if(*(long *)a > *(long *)b)
		return 1;
	else
		return -1;
}

int main()
{
	fin = fopen("alqsort.in", "rt");
	fout = fopen("alqsort.out", "wt");

	fscanf(fin, "%ld", &n);
	
	for(i = 1; i <= n; i++)
		fscanf(fin, "%ld", &a[i]);

	qsort(a + 1, n, sizeof(a[0]), comp);

	for(i = 1; i <= n; i++)
		fprintf(fout, "%ld ", a[i]);

	fprintf(fout, "\n");

	return 0;
}