#include<stdio.h>
 
#define N 100000
 
int A[N],B[N];
 
void countSort(int,int);
 
int main(){
 
  int i,j,k = 0,n;
   
  scanf("%d",&n);
   
  for(i = 0;i < n;i ++)
    {
    scanf("%d",&A[i]);
    if(k < A[i])k = A[i];
    }
   
  countSort(k,n);
   
  for(i = 1;i <= n;i ++)
    {
      if(i!=1)printf(" ");
       
      printf("%d",B[i]);
    }
  printf("\n");
   
  return 0;
}
 
 
void countSort(int k,int n){
 
  int i,j;
  int C[k + 1];
   
  for (i = 0;i <= k;i ++)
    {
      C[i] = 0;
    }
   
  for(i = 0;i < n;i ++)
    {
    C[A[i]] = C[A[i]] + 1;
    }
   
  for(i = 1;i <= k;i ++)
    {
      C[i] = C[i] + C[i-1];
    }
 
  for(i = n;i >= 0;i --)
    {
      B[C[A[i]]] = A[i];
      C[A[i]] = C[A[i]]-1;
    }
}