#include <bits/stdc++.h>
#define get_byte(x) ((x >> (8 * byte)) & 255)

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

void read()
{
  f>>n;
  for(int i = 1;i <= n;++i)
    f>>v[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], *l2 = new int[len_2];

  for(int i = 0;i < len_1;++i)
    l1[i] = v[i + left];
  for(int i = 0;i < len_2;++i)
    l2[i] = v[mid + 1 + i];
  
  int index1 = 0, index2 = 0, index3 = left;
  
  while(index1 < len_1 && index2 < len_2)
  {
    if(l1[index1] < l2[index2])
      v[index3] = l1[index1], ++index1;
    else
      v[index3] = l2[index2], ++index2;
    ++index3;
  }

  while(index1 < len_1)
    v[index3] = l1[index1], ++index1, ++index3;
  while(index2 < len_2)
    v[index3] = l2[index2], ++index2, ++index3;

  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<<v[i]<<" ";
}

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