#include <fstream>

using namespace std;

int n,i,j,v[500001],maxim,aux,k,p;

ifstream fin ("algsort.in");

ofstream fout ("algsort.out");

int main (){

    fin>>n;
    for (i=1;i<=n;i++)
        fin>>v[i];
    k = n;
    while (k != 0){
        maxim = 0;
        for (i=k;i>=1;i--){
            if (v[i] > maxim){
                maxim = v[i];
                p = i;
            }
        }
        aux = v[k];
        v[k] = v[p];
        v[p] = aux;
        k--;
    }
    for (i=1;i<=n;i++)
        fout<<v[i]<<" ";

    return 0;
}