#include <iostream>
#include <fstream>
using namespace std;

void QUICKSORT(int A[], int inf, int sup) {
  int x, i, j, t;
  i = inf;
  j = sup;
  x = A[(i + j) / 2];
  do {
    while ( (i < sup) && (A[i] < x) ) i++;
    while ( (j > inf) && (A[j] > x) ) j--;
    if ( i <= j ) {
      t = A[i];
      A[i] = A[j];
      A[j] = t;
      i++;
      j--;
    }
  } while ( i <= j );
  if ( inf < j ) QUICKSORT(A,inf, j);
  if ( i < sup ) QUICKSORT(A,i, sup);
}
int main()
{
    int A[500001],i,n;
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>A[i];
    }
    QUICKSORT(A,1,n);
    for(i=1;i<=n;i++)
    {
        fout<<A[i]<<" ";
    }
    return 0;
}