#include <fstream>
#include <queue>
using namespace std;

const int N = 500005;
int v[N], n;
priority_queue<int> Q;

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

int main()
{
    int x;

    in >> n;

    for (int i = 1 ; i <= n ; i++)
    {
        in >> x;
        Q.push(x);
    }

    for (int i = n ; i ; i--)
    {
        v[i] = Q.top();
        Q.pop();
    }

    for (int i = 1 ; i <= n ; i++)
        out << v[i] << " ";

    out << "\n";

    return 0;
}