


"""simple docstring"""






def        lowerCamelCase_(		_lowerCamelCase			,		_lowerCamelCase       )    ->     int:
   '''simple docstring'''





   return abs(_lowerCamelCase       ) if a == 0 else greatest_common_divisor(b % a			,		_lowerCamelCase       )







def        lowerCamelCase_(		_lowerCamelCase			,		_lowerCamelCase       )    ->     int:
   '''simple docstring'''





   while y:  # --> when y=0 then loop will terminate and return x as final GCD.
      _lowerCamelCase,					_lowerCamelCase   :				Union[str, Any]							=     y, x % y
   return abs(_lowerCamelCase       )







def        lowerCamelCase_(		)    ->     str:
   '''simple docstring'''





   try:
      _lowerCamelCase   :				Any							=     input("Enter two integers separated by comma (,): "       ).split(","       )
      _lowerCamelCase   :				Dict							=     int(nums[0]       )
      _lowerCamelCase   :				Tuple							=     int(nums[1]       )
      print(
          F"""greatest_common_divisor({num_a}, {num_a}) = """
          F"""{greatest_common_divisor(_lowerCamelCase			,		_lowerCamelCase       )}"""       )
      print(F"""By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(_lowerCamelCase			,		_lowerCamelCase       )}"""       )
   except (IndexError, UnboundLocalError, ValueError):
      print("Wrong input"       )


if __name__ == "__main__":
  main()

"""simple docstring"""
import os

def  lowercase     ():
						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())
