program cogs126;
var
a:array[1..500]of integer;
n,i:integer;
add:real;
procedure qsort(l,r:integer);
var
x,y,z,t:integer;
begin
x:=l;y:=r;  z:=a[(r+l)shr 1];
repeat
while a[x]<z do inc(x);
while a[y]>z do dec(y);
if x<=y then begin
t:=a[x];a[x]:=a[y];a[y]:=t;
inc(x);dec(y); end;
until x>y;
if x<r then qsort(x,r);
if y>l then qsort(l,y);
end;
begin
assign(input,'stats.in');reset(input);
assign(output,'stats.out');rewrite(output);
readln(n);    add:=0;
for i:=1 to n do begin
readln(a[i]);
add:=add+a[i];  end;
qsort(1,n);
writeln(add/n:0:6);
if  odd(n) then add:=a[(n+1)shr 1]
else add:=(a[n shr 1]+a[n shr 1 +1])/2;
writeln(add:0:6);
close(input);close(output);
end.