#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
    int n;
    long long e;
    vector<long long> v;
    fin>>n;
    for(int i=1; i<=n; i++)
    {
        fin>>e;
        v.push_back(e);
    }
    sort(v.begin(), v.end(), greater<long long>());
    while(!v.empty())
    {
        fout<<v.back()<<' ';
        v.pop_back();
    }
    fin.close();
    fout.close();
    return 0;
}