#include<fstream>
using namespace std ;
ifstream f ("algsort.in") ;
ofstream g ("algsort.out") ;
int v[500005] ;
int main ()
{
 int n , i , j ;
 f >> n ;
 for ( i = 1 ; i <= n ; ++i )
      f >> v[i] ;
  for ( i = 1 ; i < n ; ++i )
   for ( j = i + 1 ; j <= n  ; ++j )
     if ( v[i] > v[j] )
        {
         int aux = v[j] ;
         v[j] = v[i] ;
         v[i] = aux ;

        }
 for ( i = 1 ; i <= n ; ++i )
     g << v[i] << " " ;

}