






"""simple docstring"""





import os







def      lowerCamelCase__       (							)      ->				List[Any]:
  with open(os.path.dirname(_lowerCamelCase ) + '/grid.txt' ) as f:
    lowerCamelCase_         =						[]  # noqa: E741
    for _ in range(20 ):
      l.append([int(_lowerCamelCase ) for x in f.readline().split()] )

    lowerCamelCase_         =						0

    # right
    for i in range(20 ):
      for j in range(17 ):
        lowerCamelCase_         =						l[i][j] * l[i][j + 1] * l[i][j + 2] * l[i][j + 3]
        if temp > maximum:
          lowerCamelCase_         =						temp

        # down
    for i in range(17 ):
      for j in range(20 ):
        lowerCamelCase_         =						l[i][j] * l[i + 1][j] * l[i + 2][j] * l[i + 3][j]
        if temp > maximum:
          lowerCamelCase_         =						temp

        # diagonal 1
    for i in range(17 ):
      for j in range(17 ):
        lowerCamelCase_         =						l[i][j] * l[i + 1][j + 1] * l[i + 2][j + 2] * l[i + 3][j + 3]
        if temp > maximum:
          lowerCamelCase_         =						temp

        # diagonal 2
    for i in range(17 ):
      for j in range(3		,				20 ):
        lowerCamelCase_         =						l[i][j] * l[i + 1][j - 1] * l[i + 2][j - 2] * l[i + 3][j - 3]
        if temp > maximum:
          lowerCamelCase_         =						temp
    return maximum


if __name__ == "__main__":
  print(solution())












"""simple docstring"""





from __future__ import annotations







def      lowerCamelCase__       (							_lowerCamelCase       :		int )      ->				list[int]:
  lowerCamelCase_         =						[True] * limit
  lowerCamelCase_         =						False
  lowerCamelCase_         =						False
  lowerCamelCase_         =						True

  for i in range(3		,				int(limit**0.5 + 1 )		,				2 ):
    lowerCamelCase_         =						i * 2
    while index < limit:
      lowerCamelCase_         =						False
      lowerCamelCase_         =						index + i

  lowerCamelCase_         =						[2]

  for i in range(3		,				_lowerCamelCase		,				2 ):
    if is_prime[i]:
      primes.append(_lowerCamelCase )

  return primes







def      lowerCamelCase__       (							_lowerCamelCase       :		int = 1000000 )      ->				int:
  lowerCamelCase_         =						prime_sieve(_lowerCamelCase )
  lowerCamelCase_         =						0
  lowerCamelCase_         =						0

  for i in range(len(_lowerCamelCase ) ):
    for j in range(i + length		,				len(_lowerCamelCase ) ):
      lowerCamelCase_         =						sum(primes[i:j] )
      if sol >= ceiling:
        break

      if sol in primes:
        lowerCamelCase_         =						j - i
        lowerCamelCase_         =						sol

  return largest


if __name__ == "__main__":
  print(F'''{solution() = }''')




