var v:array[1..500001]of longint;
    i,n:longint;

procedure sort(l,r:longint);
var i,j,x,aux:longint;
begin
i:=l; j:=r;
x:=v[(l+r)div 2];
repeat
while v[i]<x do inc(i);
while v[j]>x do dec(j);
if i<=j then begin
   aux:=v[i]; v[i]:=v[j]; v[j]:=aux;
   inc(i); dec(j);
   end;
until i>j;
if l<j then sort(l,j);
if i<r then sort(i,r);
end;
begin
assign(input,'algsort.in');reset(input);
read(n);
for i:=1 to n do read(v[i]);
close(input);

sort(1,n);
assign(output,'algsort.out');rewrite(output);
for i:=1 to n do write(v[i],' ');
close(output);
end.