#include <stdio.h>
#define MAX 500000
#define INF 100000000
void marge(int *, int, int, int);
void margesort(int *, int, int);

int L[MAX/2+2], R[MAX/2+2];
int count;


int main(){
  int A[MAX], n, i;
  count = 0;

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

  margesort(A,0,n);



  for(i=0;i<n;i++){
    if(i>0) printf(" %d");
    else printf("%d");
  }
  printf("\n");

  return 0;
}

void merge(int *A,int left,int mid,int right){
  int i,j,k;
  int n1 = mid - left;
  int n2 = right - mid;
  /*  L[0...n1], R[0...n2] を生成 */
  for (i=0;i<n1-1;i++) L[i] = A[left + i];
  for (i=0;i<n2-1;i++) R[i] = A[mid + i];

  L[n1] = INF;
  R[n2] = INF;

  i = 0;
  j = 0;

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


void mergesort(int *A, int left,int right){
  if (left+1 < right){
    int mid = (left + right)/2;
    mergesort(A, left, mid);
    mergesort(A, mid, right);
    merge(A, left, mid, right);
  }
  }

