program cojs126;
var
  mid,ans:extended;
  i,n:longint;
  a:array[1..500]of longint;

procedure qsort(l,r:longint);
var
  i,j,x,t:longint;
begin
  randomize;
  i:=l; j:=r;
  x:=a[random(r-l+1)+l];
  repeat
    while a[i]<x do inc(i);
    while a[j]>x do dec(j);
    if i<=j then
    begin
      t:=a[i]; a[i]:=a[j]; a[j]:=t;
      inc(i); dec(j);
    end;
  until i>j;
  if i<r then qsort(i,r);
  if l<j then qsort(l,j);
end;

begin
assign(input,'stats.in');reset(input);
assign(output,'stats.out');rewrite(output);

  readln(n);
  ans:=0;
  for i:=1 to n do
  begin
    readln(a[i]);
    ans:=ans+a[i];
  end;
  ans:=ans/n;
  qsort(1,n);
  if odd(n) then
  begin
    mid:=a[n div 2+1];
  end else begin
    mid:=a[n div 2]+a[n div 2+1];
    mid:=mid/2;
  end;
  writeln(ans:0:6);
  writeln(mid:0:6);

close(input);close(output);
end.