#include <fstream>
using namespace std;
int h[500003];
void merge(int h1[], int h2[], int h3[], int n1, int n2){
  int i1=0, i2=0, poz=0;

  while (i1<n1 && i2<n2){
    if (h1[i1] < h2[i2])
      h3[poz++]= h1[i1++];
    else
      h3[poz++]= h2[i2++];
  }
  while(i1<n1)
    h3[poz++]=h1[i1++];

  while(i2<n2)
    h3[poz++]=h2[i2++];
}

void merge_sort(int h[], int n){
  if(n==1)
    return;
  int h3[n+1];
  if(n%2==1) {
    merge_sort (h, (n+1)/2);
    merge_sort (h+((n+1)/2), n/2);
    merge(h, h+(n+1)/2, h3, (n+1)/2, n/2);
  }

  else{
    merge_sort (h, n/2);
    merge_sort (h+(n/2), n/2);
    merge(h, h+(n/2), h3, n/2, n/2);
  }
  for(int i=0; i<n; i++)
    h[i]=h3[i];
}

int main(){
  ifstream fin("algsort.in");
  ofstream fout("algsort.out");
    int n;
    fin>>n;
    for(int i=0;i<n;i++)
      fin>>h[i];
    merge_sort(h,n);
    for(int i=0;i<n;i++)
      fout<<h[i]<<" ";
    return 0;
}