#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];
}

int partition(int left, int right)
{
  int i = left - 1;
  int piv = a[right];
  for(int j = left;j < right;++j)
    if(a[j] <= piv)
      {
        ++i;
        swap(a[i], a[j]);
      }
  swap(a[i + 1], a[right]);

  return i + 1;
}

void quicksort(int left, int right)
{
  if(left < right)
  {
    int pivot = partition(left, right);
    quicksort(left, pivot - 1);
    quicksort(pivot + 1, right);
  }
}

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

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