#include<stdio.h>
#include<stdlib.h>
#define nMAX 2000000
#define AMAX 10000

void Countingsort(int);
int A[nMAX],B[nMAX],C[AMAX];

int main(){

  int i,j,n;

  A[nMAX] = malloc(sizeof(short)*n+1);
  B[nMAX] = malloc(sizeof(short)*n+1);

    for(i=0;i<=AMAX;i++){
      C[i]=0;
    }

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

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



void Countingsort(int k){

    int i,j;

    for(i=1;i<=AMAX;i++){
      C[i]=C[i]+C[i-1];
    }
    for(j=1;j<=k;j++){
      B[C[A[j]]]=A[j];
      C[A[j]]--;
    }
      return ;
    }