program sortare;
 var sir:array[1..500000] of longint;
     n,i,j,ax:longint;
     f,g:text;
Begin
 assign(f,'algsort.in');reset(f);
 assign(g,'algsort.out');rewrite(g);
 readln(f,n);
 for i:= 1 to n do read(f,sir[i]);
 for i:= 1 to n-1 do
  for j:= i to n do
    if sir[i]>sir[j] then begin
       ax:=sir[i];
       sir[i]:=sir[j];
       sir[j]:=ax;
    end;
 for i:=1 to n do write(g,sir[i],' ');
 close(g);close(f);
 end.