#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#define NMAX 500005

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int i, n, x;

vector < int > sol;
priority_queue < int > pq;

int main()
{
    f >> n;

    for (i = 1; i <= n; ++ i)
    {
        f >> x;
        pq.push(x);
    }

    while (! pq.empty())
    {
        sol.push_back(pq.top());
        pq.pop();
    }

    for (i = n-1; i >= 0; --i)
        g << sol[i] << " ";
    return 0;
}