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

}