#include <fstream>
#define Max 500001
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");

int n,v[Max];

void citire ()
{
  f>>n;
  for (int i=1; i<=n; i++)
	f>>v[i];
  f.close ();
}

void quicksort (int v[], int stanga, int dreapta)
{ int i = stanga, j = dreapta, aux;
  int pivot = v[(stanga + dreapta) /2 ];
  while (i<=j)                            
    { while (v[i] < pivot) 
           i++;
      while (v[j] > pivot)
           j--;
     if (i<=j)                             
       {   aux=v[i];                       
           v[i]=v[j];
           v[j]=aux;
           i++;
           j--;
       }
     }
     if (stanga < j) 
          quicksort (v, stanga, i-1);
     if (i < dreapta) 
          quicksort (v, i, dreapta);
}

void afisare ()
{
  for (int i=1; i<=n; i++)
	g<<v[i]<<" ";
  g.close ();
}

int main ()
{
  citire ();
  quicksort (v,1,n);
  afisare ();
  return 0;
}