#include<stdio.h>
int n,A[2000000],B[200000],C[2000000] ;
void CountingSort(int );
main()
{
  int k=0,i;
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
    if(k<A[i])k=A[i];
  }
  
  CountingSort(k);
  for(i=0;i<n;i++){
    if(i!= n-1)   printf("%d ",B[i]);
    else  printf("%d\n",B[i]);
  }
  return 0;
}

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