var
  a:array[1..500]of integer;
  s,n,i:longint;
procedure qsort(l,r:longint);
var
  i,j,x,y:longint;
begin
  i:=l;j:=r;x:=a[(l+r) div 2];
  repeat
    while a[i]<x do inc(i);
    while x<a[j] do dec(j);
    if not(i>j) then
    begin
      y:=a[i];a[i]:=a[j];a[j]:=y;
      inc(i);j:=j-1;
    end;
  until i>j;
  if l<j then qsort(l,j);
  if i<r then qsort(i,r);
end;
begin
  assign(input,'stats.in');reset(input);
  assign(output,'stats.out');rewrite(output);
  read(n);
  for i:=1 to n do
  begin
    read(a[i]);
    s:=s+a[i];
  end;
  writeln(s/n:6:6);
  qsort(1,n);
  if n mod 2=0 then writeln((a[n div 2]+a[n div 2+1])/2:6:6)
  else writeln(a[n div 2+1]/1:6:6);
  close(input);close(output);
end.