public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        List<List<Integer>> arr = new ArrayList<>();
        
        IntStream.range(0, 6).forEach(i -> {
            try {
                arr.add(
                    Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
                        .map(Integer::parseInt)
                        .collect(toList())
                );
            } catch (IOException ex) {
                throw new RuntimeException(ex);
            }
        });
        
        // Added code below
        int [][] A = new int[6][6];
        
        for (int i=0; i<6; i++) {
            for (int j=0; j<6; j++) {
                A[i][j] = arr.get(i).get(j);
            }
        }
        
        int maxSum = Integer.MIN_VALUE;
        for (int i=0; i<4; i++) {
            int currSum = 0;
            for (int j=0; j<4; j++) {
                currSum = A[i][j] + A[i][j+1] 
                + A[i][j+2] + A[i+1][j+1] 
                + A[i+2][j] + A[i+2][j+1] 
                + A[i+2][j+2];
                if (currSum>maxSum) 
                maxSum = currSum;
            }
        }
        System.out.println(maxSum);
        bufferedReader.close();
    }
}

int sum= 0, maxSum= -1000;// check the damn constraints again 
    for (int J= 0; J< 4; J++) {
        for (int F=0; F< 4 ; F++) {
            
            //cout<<arr[F][J]<<":"<<arr[F][J+1]<<":"<<arr[F][J+2]<<":"<<arr[F+1][J+1]<<":"<<arr[F+2][J]<<":"<<arr[F+2][J+1]<<":"<<arr[F+2][J+2]<<endl; // debug for selecting correct line
            sum = (arr[J][F]+ arr[J][F+1]+ arr[J][F+2]+ arr[J+1][F+1]+ arr[J+2][F]+ arr[J+2][F+1]+ arr[J+2][F+2]);
            
            maxSum = (maxSum > sum ? maxSum : sum);
        }
        //cout<<maxSum<<" "; // testing right max Sums
    }
    
    cout<<maxSum<<endl; // printing maximum hourglass sum

public class Solution {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        List<List<Integer>> arr = new ArrayList<>();

        IntStream.range(0, 6).forEach(i -> {
            try {
                arr.add(
                    Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
                        .map(Integer::parseInt)
                        .collect(toList())
                );
            } catch (IOException ex) {
                throw new RuntimeException(ex);
            }
        });

        bufferedReader.close();
        int maxSum = 
            arr.get(0).get(0)+arr.get(0).get(1)+arr.get(0).get(2)+
            arr.get(1).get(1)+
            arr.get(2).get(0)+arr.get(2).get(1)+arr.get(2).get(2);
        int tmpSum = 0;
        for(int x = 0; x<arr.size()-2; x++){
            for(int y = 1; y<arr.get(0).size()-1; y++){
                    tmpSum=
                    arr.get(x).get(y-1)+arr.get(x).get(y)+arr.get(x).get(y+1)
                    +arr.get(x+1).get(y)
                    +arr.get(x+2).get(y-1)+arr.get(x+2).get(y)+arr.get(x+2).get(y+1);

                if(tmpSum>maxSum){
                    maxSum=tmpSum;
                }
                
            }
            
        }
        System.out.println(maxSum);
    
    }
}

    int max = -1000;
    int count = 0;
    for(int i = 0; i < 4; i++){
        for(int j = 0; j < 4; j++){
            count = 0;
            count+=arr[i][j];
            count+=arr[i][j+1];
            count+=arr[i][j+2];
            count+=arr[i+1][j+1];
            count+=arr[i+2][j];
            count+=arr[i+2][j+1];
            count+=arr[i+2][j+2];
            if (count>max)max = count;
        }
    }
    cout << max;

function main() {

    let arr = Array(6);

    for (let i = 0; i < 6; i++) {
        arr[i] = readLine().replace(/\s+$/g, '').split(' ').map(arrTemp => parseInt(arrTemp, 10));
    }
    let max = -Infinity;
    
    for (let i = 0; i < arr.length - 2; i++) {
        for (let j = 0; j < arr.length - 2; j++) {
            const sum = arr[i][j] + arr[i][j+1] + arr[i][j+2]
                + arr[i+1][j+1]
                + arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2];
            max = Math.max(max, sum);
        }
    }
    console.log(max);
}