#include <stdio.h>
void CountingSort(int*,int,int);
int A[10000];
int B[10000];
int C[2000000];

int main(){
  int i,n,k=0;

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

  CountingSort(A,k+1,n);

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

  return 0;
}

void CountingSort(int* A,int k,int n){
  int i,j;

  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]]--;
  }
}