#include <iostream>
#include <algorithm>
#define N 1005
using namespace std;
//ifstream fin ("eratostene1.in");
//ofstream fout ("eratostene1.out");
int n,i;
int a[N];

int main()
{
   cin>>n;
   for(i=1;i<=n;i++)
    cin>>a[i];
   ///sortarea bubble
  /** int m=n;
   bool ord=0;
   while(!ord)
   {
       ord=1;
       for(i=1;i<m;i++)
        if(a[i]<a[i+1]) ///descresc
       {
           swap(a[i],a[i+1]);
           ord=0;
       }
       m--;
   }*/
   sort(a+1,a+n+1,greater<int>());///O(nlogn)
   ///afisare
   for(i=1;i<=n;i++)
    cout<<a[i]<<" ";
   return 0;
}