#include <stdio.h>
#include <stdlib.h>

#define K 10000

void CountingSort(int, int*, int*);

int main(){
  int i, n;
  int *A, *B;

  scanf("%d", &n);

  A = malloc(sizeof(int)*n+1);
  B = malloc(sizeof(int)*n+1);

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

  CountingSort(n, A, B);

  for(i=1; i<n; i++){
    printf("%d ", B[i]);
  }
  printf("%d\n", B[n]);

  return 0;
}

void CountingSort(int n, int *A, int *B){
  int i, j;
  int C[K];

  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>=1; j--){
    B[C[A[j]]] = A[j];
    C[A[j]]--;
  }

}