#include <fstream>
using namespace std;

ifstream cin("algsort.in");
ofstream cout("algsort.out");

int n, v[500000];

void insert (int *v, int poz, int value)
{
  int i = poz - 1;
  while (i >= 0 && v[i] > value)
    {
      v[i + 1] = v[i];
      --i;
    }
  v[i + 1] = value;
}

void insertionSort(int *v, int n)
{
  for (int i = 1; i < n; ++i)
    insert (v, i, v[i]);
}

int main()
{
  cin >> n;
  for (int i = 0; i < n; ++i)
    cin >> v[i];

  insertionSort(v, n);

  for (int i = 0; i < n; ++i)
    cout << v[i] << " ";
}