// Insertion Sort - Complexitate O(n^2)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

 
ifstream in ("algsort.in");

ofstream out ("algsort.out");

 
const int dim = 500001;

 
int v[dim];

 
int
main () 
{
  
int n, i, j;
  
 
in >> n;
  
for (i = 1; i <= n; i++)
    {
      
in >> v[i];
    
}
  
 
sort (v + 1, v + n + 1);
  
 
    // afisare vector v
    for (i = 1; i <= n; i++)
    {
      
out << v[i] << " ";
    
}
  
 
return 0;

}