#include <stdio.h>
#include <vector>
#include <algorithm>

using namespace std;

vector<long> a;
long n,i;

int main()
{
 freopen("algsort.in","r",stdin); 
 freopen("algsort.out","w",stdout);
 
 long x;
 scanf("%ld\n",&n);
 for(i=1;i<=n;++i)
 {
  scanf("%ld ",&x);
  a.push_back(x);
 }  
 
 sort(a.begin(),a.end());
    
 for(i=0;i<=n-1;++i)
 {
  printf("%ld ",a[i]);
 }       
    
 return 0;    
}