#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n, a[500001],aux[500001];
void quicksort(int left,int right)
{
    if(left < right)
    {
        int mid = (left+right)/2;
        int pivot = a[mid];
        int poz_left=left, poz_right=right,t=0,nr=0;

        for(int i = left; i <= right; i++)
        {
            if(a[i] < pivot)
                aux[poz_left++] = a[i];
            else {
              if(a[i] > pivot)
                    aux[poz_right--] = a[i];
              else if (a[i] == pivot){
                    if (nr == 0) {t=a[i], nr++;}
                    else aux[poz_left++] = a[i];
                  }
              }

        }
        aux[poz_right] = t;
        for(int i = left; i <= right; i++) a[i]=aux[i];

        quicksort(left,poz_left-1);
        quicksort(poz_right+1,right);
    }
}
int main() {
  f>>n;
  for (int i=1;i<=n;i++)  f >> a[i];
  quicksort(1,n);
  for (int i=1;i<=n;i++)  g << a[i] << " ";
  return 0;
}