#include<fstream.h>
#include<stdlib.h>
#include<math.h>
long int i, n, vec[500001];
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int comp(const void *a, const void *b)
{
	if(*(long *)a > *(long *)b)
		return 1;
	else
		return -1;
}

int main()
{  	
	fin>>n;
	for(i = 1; i <= n; i++)
		fin>>vec[i];
	qsort(vec + 1, 10, sizeof(vec[0]), comp);
	for(i = 1; i <= 10; i++)
		fout<<vec[i]<<" ";
	return 0;
}