program bblesort;
type vec=array [1..500000] of int64;
var i,n:longint;
    a:vec;
    f,t:text;

procedure sort(a:vec;n:longint);
var x,r:longint;
    gata:boolean;
begin
  r:=n;
  repeat
    gata:=true;
    for i:=1 to r-1 do
      if a[i]>a[i+1] then
        begin
          gata:=false;
          x:=a[i];
          a[i]:=a[i+1];
          a[i+1]:=x;
        end;
    r:=r-1;
  until gata;
end;

begin
  assign(f,'algsort.in');
  reset(f);
  read(f,n);
  for i:=1 to n do
    read(f,a[i]);
  close(f);
  {-----------------}
  sort(a,n);
  {-----------------}
  assign(t,'algsort.out');
  rewrite(t);
  for i:=1 to n do
    write(t,a[i],' ');
  close(t);
end.