text: '''
  Objective
  Today, we're building on our knowledge of Arrays by adding another dimension. Check out the Tutorial tab for learning materials and an instructional video!
  
  Context
  Given a
  2D Array,
  
  :
  
  1 1 1 0 0 0
  0 1 0 0 0 0
  1 1 1 0 0 0
  0 0 0 0 0 0
  0 0 0 0 0 0
  0 0 0 0 0 0
  
  We define an hourglass in
  to be a subset of values with indices falling in this pattern in
  
  's graphical representation:
  
  a b c
    d
  e f g
  
  There are
  hourglasses in
  
  , and an hourglass sum is the sum of an hourglass' values.
  
  Task
  Calculate the hourglass sum for every hourglass in
  
  , then print the maximum hourglass sum.
  
  Input Format
  
  There are
  lines of input, where each line contains space-separated integers describing 2D Array ; every value in will be in the inclusive range of to
  
  .
  
  Constraints
  
  Output Format
  
  Print the largest (maximum) hourglass sum found in
  
  .
  
  Sample Input
  
  1 1 1 0 0 0
  0 1 0 0 0 0
  1 1 1 0 0 0
  0 0 2 4 4 0
  0 0 0 2 0 0
  0 0 1 2 4 0
  
  Sample Output
  
  19
  
  Explanation
  
  contains the following hourglasses:
  
  1 1 1   1 1 0   1 0 0   0 0 0
    1       0       0       0
  1 1 1   1 1 0   1 0 0   0 0 0
  
  0 1 0   1 0 0   0 0 0   0 0 0
    1       1       0       0
  0 0 2   0 2 4   2 4 4   4 4 0
  
  1 1 1   1 1 0   1 0 0   0 0 0
    0       2       4       4
  0 0 0   0 0 2   0 2 0   2 0 0
  
  0 0 2   0 2 4   2 4 4   4 4 0
    0       0       2       0
  0 0 1   0 1 2   1 2 4   2 4 0
  
  The hourglass with the maximum sum (
  
  ) is:
  
  2 4 4
    2
  1 2 4
  
  '''
  
  import math
  import os
  import random
  import re
  import sys
  
  
  
  if __name__ == '__main__':
      arr = []
  
      for _ in range(6):
          arr.append(list(map(int, input().rstrip().split())))
      sums = []
      for i in range(len(arr) - 2):
          for j in range(len(arr[i]) - 2):
              val = 0
              for row in range(i, i + 3):
                  for col in range(j, j + 3):
                      if row == i or row == i + 2:
                          val += arr[row][col]
                      elif row == i + 1 and col == j + 1:
                          val += arr[row][col]
              sums.append(val)
      print(max(sums))