#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;

struct compare
{
    bool operator() (const int &a, const int &b)
    {
        return a > b;
    }
};

priority_queue < int, vector < int >, compare > pq;

int main()
{
    f >> n;

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

    while (! pq.empty())
    {
        g << pq.top() << " ";
        pq.pop();
    }

    return 0;
}