#include <fstream>

using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int A[500001],n;
void QUICKSORT(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(inf,j);
  if (i<sup) QUICKSORT(i,sup);
}
int main()
{

  fin>>n;

  for(int i=1;i<=n;i++)fin>>A[i];
  QUICKSORT(1,n);
for(int i=1;i<=n;i++)fout<<A[i]<<' ';
    return 0;
}