#include <fstream>
#include <algorithm>

using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
const int NMAX =  500000;
int v[NMAX+5];

/// Quick sort in-place
void quickSort(int v[], int a, int b)
{
   if(a>=b)
     return;
   int right = b-1;
   int left = a;
   int pivot = v[b];
   ///On left i will have all terms which are smaller and equal then pivot
   ///On right i will have all terms which are greater then pivots

   while(left<=right)
   {
      while(left<=right && v[left]<pivot)
        left++;
      while(left<=right && v[right] > pivot)
        right--;
      if(left<=right)
      {
          swap(v[left], v[right]);
          left++;
          right--;
      }
   }
   swap(v[left], v[b]);
   quickSort(v, a, left-1);
   quickSort(v, left+1, b);

}
int main()
{
    int n, i;
    fin>>n;
    for(i=1;i<=n;i++)
       fin>>v[i];
    quickSort(v, 1, n);
   // sort(v+1, v+n+1);
    for(i =1;i<=n;i++)
        fout<<v[i]<<" ";
    fout<<"\n";
    return 0;
}