#include <stdio.h>
#define N 20000001

int B[N], n;

void CountingSort( int A[], int k ){
  int i, j, C[N];
  for( i = 0; i <= k; i++ ){
    C[i] = 0;
  }
  for( j = 1; j <= n; j++ ){
    C[A[j]]++;
  }
  for( i = 1; i <= k; i++ ){
    C[i] = C[i] + C[i-1];
  }
  for( j = n; j > 0; j-- ){
    B[C[A[j]]] = A[j];
    C[A[j]]--;
  }
}

main(){

  int i, A[N], max = 0;
  scanf("%d", &n);

  for( i = 1; i <= n; i++ ){
    scanf("%d", &A[i]);
     if(max < A[i]){
      max = A[i];
    }
  }

  CountingSort(A, max);
  
  for( i = 1; i <= n; i++ ){
    if(i > 0) printf(" ");
    printf("%d", B[i]);
  }
  printf("\n");
  return 0;
}