#include <iostream>
#include <fstream>

using namespace std;

int v[5000000];
ifstream in("algsort.in");
ofstream out("algsort.out");





void quicksort ( int st, int dr) {
    int aux;
    int i = st;
    int j = dr;
    int mij = (st + dr) / 2;
    int x = v[mij];
    do {
      while (v[i] < x) i++;
      while (v[j] > x) j--;
        if (i <= j) {
          aux = v[i];
          v[i] = v[j];
          v[j] = aux;
          i++;
          j--;
        }
    } while (i <= j);


    if (st < j) quicksort( st, j);
    if (i < dr) quicksort( i, dr);
  }



int main()
{int n;
in>>n;
for(int i=0;i<n;i++)in>>v[i];
quicksort(0,n-1);
for(int i=0;i<n;i++)out<<v[i]<<' ';

    return 0;
}