program sort;
type vec=array [1..500] of longint;
var i,j,k,n,x:longint;
    a:vec;
    f,t:text;
begin
  assign(f,'algsort.in');
  reset(f);
  read(f,n);
  for i:=1 to n do
    read(f,a[i]);
  close(f);
  {--------------scriere------------------}
  for i:=1 to n do
    begin
      j:=1;
      while a[i]>a[j] do
        j:=j+1;
      if j<i then
        begin
          x:=a[i];
          for k:=i downto j+1 do
            a[k]:=a[k-1];
          a[j]:=x;
        end;
    end;
  {--------------citite-------------------}
  assign(t,'algsort.out');
  rewrite(t);
  for i:=1 to n do
    write(t,a[i],' ');
  close(t);
end.