#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("algsort.in");
ofstream out ("algsort.out");
int N, v[500005];
int main()
{
    in>>N;
    int x;
    for (int i=0;i<N;++i)
    {
        in>>x;
        v[i]=x;
        int ceva=i;
        for (int j=i-1;j>=0;--j)
        {

            if (v[ceva]<v[j])
                {
                    swap (v[ceva], v[j]);
                    ceva=j;
                }

        }
    }
    for (int i=0;i<N;++i)
        out<<v[i]<<" ";
    return 0;
}