#include <bits/stdc++.h>

using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n, a[500001];

void read()
{
  f>>n;
  for(int i = 1;i <= n;++i)
    f>>a[i];
}

void merge(int left, int mid, int right)
{
  int len_1 = mid - left + 1;
  int len_2 = right - mid;

  int *L1 = new int[len_1];
  int *L2 = new int[len_2];
  for(int i = 0;i < len_1;++i)
    L1[i] = a[i + left];
  for(int i = 0;i < len_2;++i)
    L2[i] = a[i + mid + 1];
  
  int i = 0, j = 0, k = left;
  while(i < len_1 && j < len_2)
  {
    if(L1[i] < L2[j])
      a[k] = L1[i], ++i;
    else
      a[k] = L2[j], ++j;
    ++k;
  }

  while(i < len_1)
    a[k] = L1[i], ++i, ++k;
  while(j < len_2)
    a[k] = L2[j], ++j, ++k;
  
  delete L1;
  delete L2;
}

void mergesort(int left, int right)
{
  if(left < right)
  {
    int mid = (left + right) >> 1;
    mergesort(left, mid);
    mergesort(mid + 1, right);
    merge(left, mid, right);
  }
}

void solve()
{
  mergesort(1, n);
  for(int i = 1;i <= n;++i)
    g<<a[i]<<" ";
}

int main()
{
  read();
  solve();
  return 0;
}