#include<fstream>
#include<queue>
using namespace std;
int main() {
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    int n, i, x;
    priority_queue<int> lista;
    vector<int>a;
    vector<int>::iterator it, start, finish;
    f>>n;
    for(i = 1; i <= n; i++) {
          f>>x;
          lista.push(x); }
    while(!lista.empty()) {
          a.push_back(lista.top());
          lista.pop(); }
    start = a.begin();
    finish = a.end();
    reverse(start, finish);
    for(it = start; it != finish; it++)
          g<<*it<<" ";
    return 0;
}