#30daysofcode #day11

//https://www.hackerrank.com/challenges/30-2d-arrays/

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;

class Solution {

    static void Main(String[] args) {
        int[][] arr = new int[6][];
        for(int arr_i = 0; arr_i < 6; arr_i++){
           string[] arr_temp = Console.ReadLine().Split(' ');
           arr[arr_i] = Array.ConvertAll(arr_temp,Int32.Parse);
        }

        int[] sums = new int[16];
        //for(int i = 0; i < 16; i++){
        //  sums[i] = 0;
        //}

        int helper = 0;

        for(int j = 0; j < 4; j++){
          for(int i = 0; i < 4; i++){
            sums[helper] = (arr[j][i] + arr[j][i+1] + arr[j][i+2] + arr[j+1][i+1] + arr[j+2][i] + arr[j+2][i+1] + arr[j+2][i+2]);
            //Console.WriteLine(sums[helper]);
            helper++;
          }
        }

        //Console.WriteLine(helper);
        //Console.WriteLine(sums[helper-1]);

        int max = sums[0];
        for(int i = 1; i < 16; i++){
          if(sums[i] > max){
            max = sums[i];
          }
        }

        Console.WriteLine(max);
    }
}