{believe spring brother}
program gupiao;
var
a:array[1..1000] of real;
i,j,n,money,s,t:longint;
max:real;
begin
assign (input,'stock.in');
reset (input);
assign (output,'stock.out');
rewrite (output);
readln (n);
for i:=1 to n do
read (a[i]);
readln;
readln (money);
max:=0;
for i:=1 to n-1 do
for j:=i+1 to n do
begin
t:=t+1;
if (trunc(money/a[i])*(a[j]-a[i])>max) and (money>=a[i]) then
max:=trunc(money/a[i])*(a[j]-a[i]);
if (a[j]-a[i]>0) and (money>=a[i]) then
s:=s+1
end;
writeln (max:0:3);
writeln (s/t:0:3);
close (input);
close (output)
end.