#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

vector<long> a;
long n,i;

int main()
{
 ifstream in("algsort.in"); 
 ofstream out("algsort.out");
 
 long x;
 in >> n;
 for(i=1;i<=n;++i)
 {
  in >> x;
  a.push_back(x);
 }  
 
 sort(a.begin(),a.end());
    
 for(i=0;i<=n-1;++i)
 {
  out << a[i] << " ";
 }       
 
 in.close();
 out.close();
    
 return 0;    
}