var  
     summax, max1, max2, d_min, k :integer; 
     mass: array[1..20] of integer; 
     sa :string; 
  function findSubSum(valueString, suffix : string) : string; 
  var  
      i,j,nn,m,x:integer; 
  begin 
       if(valueString = '') then 
         begin 
           if(suffix <> '') then 
             begin 
               //suffix - полученная подпоследовательность 
               m := 0; 
               for i:= 1 to k do begin 
                 if pos(sa[ i ], suffix) > 0 then begin 
                   nn := pos(sa[ i ], sa); 
                   m  := m + mass[nn]; 
                  end; 
               end; 
               if m mod 2 = 0 then 
                 if m > max1 then begin 
                     max1 := m 
                   end 
                 else  
                   if (m > max2) and (max1 <> m) and ((max1 - m)  mod 5 <> 0)  then  
                     max2 := m; 
             end; 
           exit; 
         end;   
       findSubSum(Copy(valueString,2,length(valueString)-1    ), suffix + valueString[1]); 
       findSubSum(Copy(valueString,2,length(valueString)-1    ), suffix); 
  end; 
   
   
 var  
     i,j,n,m:integer; 
     t:text; 
     var value :string; 
  begin 
     assign(t,'27-67b.txt'); 
     reset(t); 
     readln(t,n); 
     sa := 'abcdefghijklmnopqrst'; 
     summax := 0; 
     d_min := 10001; 
     for i:= 1 to n do begin 
         read(t,k); 
         for j:= 1 to k do read(t,mass[j]); 
         readln(t); 
         value:= ''; 
         for m:=1 to k do  value := value + sa[m]; 
         max1 := 0; 
         max2 := 0; 
         findSubSum(value, ''); 
         summax := summax + max1; 
         if (max2 > 0) and ((max1 - max2) < d_min)   then 
                       d_min := (max1 - max2); 
     end;   
     println(' ===  ',summax, '  === ', d_min); 
     if summax mod 5 = 0 then 
         println(' ответ ',summax - d_min) 
     else 
          println(' ответ ',summax);    
  
     println(milliseconds / 1000); 
  
  end.