program gyorsrendezes;
var v:array[0..500000] of longint;
    n,i:longint;

procedure QuickSort(jobb, bal:longint);
var i,j,x,aux:longint;
begin
 i:=jobb;
 j:=bal;
 x:=v[(jobb+bal) div 2];
 while i<=j do
   begin
     while v[i] < x do inc(i);
     while  x < v[j] do dec(j);
     if i<=j then
        begin
         aux:=v[i];
         v[i]:=v[j];
         v[j]:=aux;
         inc(i);
         dec(j);
        end;
   end;
 if jobb < j then QuickSort(jobb,j);
 if  i < bal then QuickSort(i,bal );
end;

begin
 assign(input,'algsort.in');
 assign(output,'algsort.out');
 reset(input);
 rewrite(output);
 readln(n);
 for i:=1 to n do
     read(v[i]);
 QuickSort(1,n);
 for i:=1 to n do
     write(v[i],' ');
end.