type vector=array[1..500000] of longint;
var a:vector; n,i:longint;
procedure qsort(var a:vector; lo,hi:longint);
procedure sort (l,r:longint);
var i,j,x,y:longint;
begin
i:=l; j:=r; x:=a[(l+r)div 2];
repeat
while a[i]<x do i:=i+1;
while x<a[j] do j:=j-1;
if i<=j then
begin
y:=a[i]; a[i]:=a[j]; a[j]:=y;
inc(i); dec(j);
end;
until i>j;
if l<j then sort(l,j);
if i<r then sort(i,r);
end;
begin
sort(lo,hi);
end;
begin
assign (input,'algsort.in');
reset (input);
readln (input,n);
for i:=1 to n do
read (input,a[i]);
close (input);
qsort(a,1,n);
assign (output,'algsort.out');
rewrite (output);
for i:=1 to n do
write (output,a[i],' ');
close (output);
end.