



import os




def      UpperCAmelCase__			(				__snake_case				) ->			Optional[int]:
  _A							     =     len(grid[0]				)
  _A							     =     len(SCREAMING_SNAKE_CASE__				)

  _A							     =     0
  _A							     =     0
  _A							     =     0

  # Check vertically, horizontally, diagonally at the same time (only works
  # for nxn grid)
  for i in range(SCREAMING_SNAKE_CASE__				):
    for j in range(n_rows - 3				):
      _A							     =     grid[j][i] * grid[j + 1][i] * grid[j + 2][i] * grid[j + 3][i]
      _A							     =     grid[i][j] * grid[i][j + 1] * grid[i][j + 2] * grid[i][j + 3]

      # Left-to-right diagonal (\) product
      if i < n_columns - 3:
        _A							     =     (
            grid[i][j]
            * grid[i + 1][j + 1]
            * grid[i + 2][j + 2]
            * grid[i + 3][j + 3]
        )

      # Right-to-left diagonal(/) product
      if i > 2:
        _A							     =     (
            grid[i][j]
            * grid[i - 1][j + 1]
            * grid[i - 2][j + 2]
            * grid[i - 3][j + 3]
        )

      _A							     =     max(
          SCREAMING_SNAKE_CASE__    ,					SCREAMING_SNAKE_CASE__    ,					SCREAMING_SNAKE_CASE__    ,					SCREAMING_SNAKE_CASE__				)
      if max_product > largest:
        _A							     =     max_product

  return largest




def      UpperCAmelCase__			(				) ->			Optional[Any]:
  _A							     =     []
  with open(os.path.dirname(SCREAMING_SNAKE_CASE__				) + '''/grid.txt'''				) as file:
    for line in file:
      grid.append(line.strip('''\n'''				).split(''' '''				)				)

  _A							     =     [[int(SCREAMING_SNAKE_CASE__				) for i in grid[j]] for j in range(len(SCREAMING_SNAKE_CASE__				)				)]

  return largest_product(SCREAMING_SNAKE_CASE__				)


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







'''simple docstring'''



from queue import PriorityQueue
from typing import Any

import numpy as np



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						dict,       SCREAMING_SNAKE_CASE__:						str,       SCREAMING_SNAKE_CASE__:						set,       SCREAMING_SNAKE_CASE__:						set,       SCREAMING_SNAKE_CASE__:						dict,       SCREAMING_SNAKE_CASE__:						dict,       SCREAMING_SNAKE_CASE__:						PriorityQueue,       SCREAMING_SNAKE_CASE__:						dict,       SCREAMING_SNAKE_CASE__:						float | int,       )	->      float | int:

   """simple docstring"""
   for nxt, d in graph[v]:
      if nxt in visited_forward:
         continue
      __a					  =     cst_fwd.get(SCREAMING_SNAKE_CASE__,       np.inf     )
      __a					  =     cst_fwd[v] + d
      if new_cost_f < old_cost_f:
         queue.put((new_cost_f, nxt)     )
         __a					  =     new_cost_f
         __a					  =     v
      if nxt in visited_backward:
         if cst_fwd[v] + d + cst_bwd[nxt] < shortest_distance:
            __a					  =     cst_fwd[v] + d + cst_bwd[nxt]
   return shortest_distance



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						str,       SCREAMING_SNAKE_CASE__:						str,       SCREAMING_SNAKE_CASE__:						dict,       SCREAMING_SNAKE_CASE__:						dict     )	->      int:

   """simple docstring"""
   __a					  =     -1

   __a					  =     set()
   __a					  =     set()
   __a					  =     {source: 0}
   __a					  =     {destination: 0}
   __a					  =     {source: None}
   __a					  =     {destination: None}
   __a					  =     PriorityQueue()
   __a					  =     PriorityQueue()

   __a					  =     np.inf

   queue_forward.put((0, source)     )
   queue_backward.put((0, destination)     )

   if source == destination:
      return 0

   while not queue_forward.empty() and not queue_backward.empty():
      __a  ,      __a					  =     queue_forward.get()
      visited_forward.add(SCREAMING_SNAKE_CASE__     )

      __a  ,      __a					  =     queue_backward.get()
      visited_backward.add(SCREAMING_SNAKE_CASE__     )

      __a					  =     pass_and_relaxation(
          SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       )

      __a					  =     pass_and_relaxation(
          SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       SCREAMING_SNAKE_CASE__,       )

      if cst_fwd[v_fwd] + cst_bwd[v_bwd] >= shortest_distance:
         break

   if shortest_distance != np.inf:
      __a					  =     shortest_distance
   return shortest_path_distance


__UpperCamelCase   :							Dict         =   {
    """B""": [["""C""", 1]],
    """C""": [["""D""", 1]],
    """D""": [["""F""", 1]],
    """E""": [["""B""", 1], ["""G""", 2]],
    """F""": [],
    """G""": [["""F""", 1]],
}
__UpperCamelCase   :							int         =   {
    """B""": [["""E""", 1]],
    """C""": [["""B""", 1]],
    """D""": [["""C""", 1]],
    """F""": [["""D""", 1], ["""G""", 1]],
    """E""": [[None, np.inf]],
    """G""": [["""E""", 2]],
}

if __name__ == "__main__":
 import doctest

 doctest.testmod()