#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#define FIN "algsort.in"
#define FOUT "algsort.out"

using  namespace std;

vector<uint> vec;

void _swap(uint i, uint j) {

     uint aux = vec[ i ];
         vec[ i ] = vec[ j ];
         vec[ j ] = aux;
}

void quicksort(uint lo, uint hi) {

     uint pivot = vec[ (lo + hi) >> 1],
          i = lo,
          j = hi;

          while(i <= j) {
                 while(vec[i] < pivot) i++;
                 while(vec[j] > pivot) j--;
                 if(i<=j) {_swap(i, j); i++; j--;}
          }

          if(lo < j) quicksort(lo, j);
          if(i < hi) quicksort(i, hi);

}

int main(int argc, char const *argv[]) {

  uint N,
       num;

  ifstream fin(FIN);
  ofstream fout(FOUT);

  fin>>N;
  for(uint i = 1; i <= N; i++) {

      fin>>num;
      vec.push_back(num);
  }

  quicksort(0, N - 1);

  //for(vector<ulong>::iterator it = vec.begin(); it != vec.end(); it++) {

      //fout<<(*it)<<" ";
  //}
   for(int i = 0; i < N; ++i) fout<<vec[ i ]<<" ";

  return(0);
}