#include <stdio.h>
#include <stdlib.h>

void merge(int *, int, int, int);

void mergesort(int *, int, int);

main(){
  int i, n, a[500001];

  scanf("%d", &n);

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

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

  return 0;
}
void mergesort(int *a, int left, int right){
  int mid;
  if( (left + 1) < right){
    mid = (left + right)/2;
    mergesort(a, left, mid);
    mergesort(a, mid, right);
    merge(a, left, mid, right);
  }
}
void merge(int *a, int left, int mid, int right){
  int n1,n2,i,j,k;
  int *L,*R;

  n1 = mid - left;
  n2 = right - mid;

  L = malloc(sizeof(n1));
  R = malloc(sizeof(n2));

  for(i = 0;i < n1;i++) L[i] = a[left + i];
  for(i = 0;i < n2;i++) R[i] = a[mid + i];
  L[n1] = 10000000001; 
  R[n2] = 10000000001;

  i = 0;
  j = 0;

  for(k = left;k < right;k++){
    if(L[i] <= R[j]){
      a[k] = L[i];
      i += 1;
    }
    else{
      a[k] = R[j];
        j += 1;
    }
  }
}