#include <fstream>
#include <queue>

using namespace std;

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

priority_queue<int> heap;

int v[500005], n;

int main()
{
    fin >> n;
    int cpy=n-1;
    for (int i=1; i <= n; i++)
       {
        fin >> v[i];
        heap.push(v[i]);
       }

    while(!heap.empty())
    {
        v[cpy--]=heap.top();
        heap.pop();
    }
    for (int i=0; i < n; i++)
        fout << v[i] << ' ';

    fin.close();
    fout.close();

    return 0;
}