#include <fstream>
using namespace std;

int a[500000];
void merge(int,int,int);
void merge_sort(int low,int high)
{
 int mid;
 if(low<high)
 {
  mid = low + (high-low)/2; // BUG - ANTI Overflow
  merge_sort(low,mid);
  merge_sort(mid+1,high);
  merge(low,mid,high);
 }
}
void merge(int low,int mid,int high)
{
 int h,i,j,b[50],k;
 h=low;
 i=low;
 j=mid+1;

 while((h<=mid)&&(j<=high))
 {
  if(a[h]<=a[j])
  {
   b[i]=a[h];
   h++;
  }
  else
  {
   b[i]=a[j];
   j++;
  }
  i++;
 }
 if(h>mid)
 {
  for(k=j;k<=high;k++)
  {
   b[i]=a[k];
   i++;
  }
 }
 else
    {
    for(k=h;k<=mid;k++)
    {
        b[i]=a[k];
        i++;
    }
    }
    for(k=low;k<=high;k++)
        a[k]=b[k];
}
int main()
{
    int n,i;
    ifstream f("algsort.in");
    f >> n;
    for(i = 0; i < n; ++i)
        f >> a[i];
    f.close();
    merge_sort(0,n-1);
    ofstream g("algsort.out");
    for(i = 0; i < n; ++i)
        g << a[i] << ' ';
    g.close();
    return 0;
}