#include<iostream>
#include<fstream.h>
#include<vector>
#include<algorithm>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

vector<int> v;
int n,x,i;

bool cmp(int x, int y)
{
	return y>x;
}

int main()
{
	fin>>n;
	for(i=0;i<n;i++)
	{
		fin>>x;
		v.push_back(x);
	}
	
	sort(v.begin(),v.end(),cmp);
	for(i=0;i<n;i++)
		fout<<v[i]<<" ";
return 0;

}