Pascal :

var a:array[1..1000] of longint;
    ans,num,i,t,n:longint;

procedure qsort(l,r:longint);
var i,j,t,mid:longint;
begin
  i:=l; j:=r; mid:=a[(i+j) div 2];
  repeat
    while a[i]<mid do inc(i);
    while a[j]>mid 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 l<j then qsort(l,j);
  if i<r then qsort(i,r);
end;

begin
  readln(n);
  num:=0;
  for i:=1 to n do
  begin
    readln(t);
    if (t>=1) and (t<=100) then
    begin
      inc(num);
      a[num]:=t;
      ans:=ans+t;
    end;
  end;
  writeln(ans/num:0:2);
  qsort(1,num);
  for i:=1 to round(n*0.1) do
    ans:=ans-a[i];
  for i:=num downto num+1-round(n*0.1) do
    ans:=ans-a[i];
  num:=num-round(n*0.1)*2;
  writeln(ans/num:0:2);
end.