import java.util.Scanner;


public class Main {

    /**
     * @param args
     */
    public static int sum = 0;
    public static int max = Integer.MIN_VALUE;
    public static boolean [] col = new boolean [9];
    public static boolean [] row = new boolean [9];
    public static int  [] hash = new int [9];
    public static boolean [] [] bool = new boolean [9][9];        
public static    int [] [] num = new int [9][9];
    public static void main(String[] args) {
        Scanner sc =new Scanner(System.in);
        for (int i = 1; i <9; i++) {
            for (int j = 1; j < 9; j++) {
                num[i][j]=sc.nextInt();
            }
        }
        f(1);
        System.out.println(max);
    }
    public static void f(int step){
        if(step==9){
            max=Math.max(sum, max);
            return;
        }
        for (int i = 1; i <= 8; i++) {  
            
                if (isConfilct(step, i)) {   
                    continue;  
                } else { 
                    hash[step] = i;
                    sum+=num[step][i];
                    f(step + 1);  
                    sum-=num[step][i];
                      hash[step] = -1;  
                   
                }  
            }  
    }
     private static boolean isConfilct(int row, int column) {  //一行一个皇后，第n个皇后也代表着第n行
            if(row == 1){//第1行永远不会冲突  
                return false;  
            }  
            //只需要保证与那些已经就位的皇后不冲突即可  
            for (int i = 1; i < row; i++) {  
                if (hash[i] == column || ( column - row) == (hash[i] - i) || (row - column)== (i-hash[i])   
                    || (row + column) == (hash[i] + i)) {  
                    return true;  
                }  
            }  
            return false;  
        }  
      


}