#include <fstream>
using namespace std;
int h[500002];
int n;
void quicksort(int st, int dr){
  int mij=(st+dr)/2;
  int i=st, j=dr;
  while(i<=j){
    while(h[i]<h[mij])
      i++;
    while(h[j]>h[mij])
      j--;
    if(i<=j){
      swap(h[i], h[j]);
      i++, j--;
    }
  }
  if(j>=st)
    quicksort(st, j);
  if(i<=dr)
    quicksort(i, dr);
}

int main(){
  ifstream fin("algsort.in");
  ofstream fout("algsort.out");
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>h[i];
    quicksort(1, n);
    for(int i=1;i<=n;i++)
        fout<<h[i]<<" ";
    return 0;
}