program Bricks;

var
   f:text;
   nStolb:integer;
   n: array [1..50] of integer;
   sum,sred:integer;
   num,i:integer;


begin
     Assign(f,'bricks.in');
     Reset(f);
     num:=0;
     ReadLn(f,nStolb);
     while nStolb>0 do
           begin
           sum:=0;
           for i:=1 to nStolb do
               begin
               Read(f,n[i]);
               sum:=sum+n[i]
               end;
           sred:=sum div nStolb;
           sum:=0;
           for i:=1 to nStolb do
               if n[i]>sred then
                  sum:=sum+(n[i]-sred);
           inc(num);
           WriteLn('Набор #',num);
           WriteLn('Минимальное количество перемещений - ',sum,'.');
           WriteLn;
           ReadLn(f,nStolb);
           end;
     Close(f);
end.