#include <stdio.h>
#define N 20000

void countingsort(int A[],int n,int k){
  int i,j;
  int B[N],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]]--;
  }

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

int searchbig(int A[],int n){
  int i,max=0;
  for(i=0;i<n;i++){
    if(max < A[i])
      max == A[i];
  }
  return max;
}

int main(){
  int i,n,A[N];

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

  countingsort(A,n,searchbig(A,n));

  return 0;
}
