#include <stdio.h>
#define n 20

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

int main(){
  unsigned short A[n], B[n];
  int A_len, i, k=0;

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

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

void CountingSort(unsigned short *A, unsigned short *B, int A_len, int k){
  int i, C[k+1];

  for(i = 0; i <= k; i++) C[i] = 0;
  for(i = 0; i < A_len; i++) C[A[i]]++;
  for(i = 0; i <= k; i++) C[i] += C[i-1];
  for(i = A_len-1; i >= 0; i--){
    B[(C[A[i]]-1)] = A[i];
    C[A[i]]--;
  }
}

