#include <fstream>
#include <queue>
using namespace std;
#define LIM_MAX 500000


ifstream in("algsort.in");
ofstream out("algsort.out");
priority_queue<int> myHeap;
int myArray[LIM_MAX];
int N;
int x;

int main()
{
    in >> N;
    int cnt = N;

    for (int i = 0; i != N; ++i)
    {
        in >> x;
        myHeap.push(x);
    }
    in.close();

    while (!myHeap.empty())
    {
        myArray[--cnt] = myHeap.top();
        myHeap.pop();
    }

    for (int i = 0; i != N; ++i)
        out << myArray[i] << " ";
    out.close();

    return 0;
}