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