#include <bits/stdc++.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
int v[500002];
int compare(const void *a, const void *b)
{   int l = *(const int *)a;
    int r = *(const int *)b;
    if (l - r >= 0)
        return 1;
    else
        return -1;

}

int main()
{ f>>n;
for(int i=1;i<=n;i++)
    f>> v[i];
    qsort(v, n+1, sizeof(int), compare);
for(int i=1;i<=n;i++)
    cout<< v[i]<< " " ;
}