Program sortarea_c;
var f,g:text;
    i,n:longint;
    a:array[0..500000] of longint;
 
Procedure quick(p,u:longint);
var mij,t,i,j:longint;
begin
mij:=a[(p+u) div 2]; i:=p; j:=u;
repeat
while a[i]<mij do i:=i+1;
while a[j]>mij do j:=j-1;
if i<=j then begin t:=a[i]; a[i]:=a[j]; a[j]:=t;
                   i:=i+1; j:=j-1;
             end;
until i>=j;
if j>p then quick(p,j);
if i<u then quick(i,u);
end;
 
begin
assign(f,'algsort.in'); reset(f);
assign(g,'algsort.out'); rewrite(g);
readln (f,n);
for i:=1 to n do read (f,a[i]);
quick(1,n);
for i:=1 to n do write (g,a[i],' ');
close(f);
close(g);
end.