#include <fstream>
#include <queue>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
const int NMax = 500000;
int X[NMax + 5]; int N;
priority_queue <int> Q;
void Read()
{
    fin >> N;
    for(int i = 1; i <= N; ++i)
        fin >> X[i];
}

void Solve()
{
    for(int i = 1; i <= N; ++i)
        Q.push(X[i]);
    for(int i = N; i >= 1; --i)
    {
        X[i] = Q.top();
        Q.pop();
    }
}

void Print()
{
    for(int i = 1; i <= N; ++i)
        fout << X[i] << " ";
}

int main()
{
    Read();
    Solve();
    Print();
    return 0;
}