#include <bits/stdc++.h>
#define oo 0x3f3f3f3f
#define get_byte(x) ((x >> (8 * byte)) & 0xff)

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

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

void merge(int *arr, int left, int mid, int right)
{
  int len1 = mid - left + 1, len2 = right - mid;

  int l1[len1], l2[len2];

  for(int i = 0;i < len1;++i)
    l1[i] = arr[left + i];
  for(int i = 0;i < len2;++i)
    l2[i] = arr[mid + 1 + i];
  
  int index1 = 0, index2 = 0, index3 = left;

  while(index1 < len1 && index2 < len2)
  {
    if(l1[index1] < l2[index2])
      arr[index3] = l1[index1], ++index1;
    else
      arr[index3] = l2[index2], ++index2;
    ++index3;
  }

  while(index1 < len1)
    arr[index3] = l1[index1], ++index1, ++index3;
  while(index2 < len2)
    arr[index3] = l2[index2], ++index2, ++index3;

}

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

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

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