#include <stdio.h>
#define  M 2000009

void counting_sort(int n);

int A[M],B[M];
int C[M];
int i, n = 0; 

main(){
  scanf("%d",&n);
  for(i = 0; i < n; i++){
    scanf("%d",&A[i]);    
  }
  
  counting_sort(n);
  for(i = 1; i <= n; i++){
    if(i == n) printf("%d",B[i]);
    else printf("%d ",B[i]);

  }
  printf("\n");
  
  return 0;
}

void counting_sort(int k)
{
  int  i;
  
  for (i = 0; i <= M; i++)
    C[i] = 0;
  
  for (i = 0; i < k; i++)
    C[A[i]]++;
  
  for (i = 0; i < n; i++) {
    C[i+1] += C[i];
  }
  
  for (i = k - 1; i >= 0; i--) {
    B[C[A[i]]] = A[i];
    C[A[i]]--;
  }

}