#include
<iostream>
#include <algorithm>
using namespace std ;
bool cmp( int x, int y){
return x>y;
}
int main(){
int n;
int buf[ 100 ];
while ( scanf ( "%d" ,&n)!= EOF ){
for ( int i= 0 ;i<n;i++){
cin >>buf[i];
}
sort (buf,buf+n, cmp );
for ( int i= 0 ;i<n;i++){
cout <<buf[i]<< " " ;
}
cout << endl ;
}
return 0 ;
#include <algorithm>
using namespace std ;
bool cmp( int x, int y){
return x>y;
}
int main(){
int n;
int buf[ 100 ];
while ( scanf ( "%d" ,&n)!= EOF ){
for ( int i= 0 ;i<n;i++){
cin >>buf[i];
}
sort (buf,buf+n, cmp );
for ( int i= 0 ;i<n;i++){
cout <<buf[i]<< " " ;
}
cout << endl ;
}
return 0 ;
}