





'''simple docstring'''







import os






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

								_a								= 0

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

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

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

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


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







def 						__SCREAMING_SNAKE_CASE  (				UpperCamelCase__ )  ->				list[int]:







			'''simple docstring'''

			if length <= 0 or not isinstance(UpperCamelCase__			,			UpperCamelCase__ ):
						raise ValueError('''Length must be a positive integer.''' )
			return [n * (2 * n - 1) for n in range(UpperCamelCase__ )]


if __name__ == "__main__":
				print(hexagonal_numbers(length=5))
				print(hexagonal_numbers(length=10))



