program sortare;
var f,g:text;
    n,i:longint;
    v:array of qword;
    aux:qword;
    ok:boolean;

begin
 assign (f,'algsort.in'); reset (F);
 assign (g,'algsort.out'); rewrite (G);
 readln (f,n);
 setlength (v,n+1);
 for i:=1 to n do
  read (f,v[i]);
 repeat
  ok:=true;
  for i:=1 to n-1 do
   if v[i]>v[i+1] then
   begin
    aux:=v[i]; v[i]:=v[i+1]; v[i+1]:=aux; ok:=false;
   end;
 until ok;
 for i:=1 to n do
  write (g,v[i],' ');
  close (f);
  close (g);
end.