
'''simple docstring'''



def A				(__lowerCamelCase				:list		):
						_lowerCAmelCase  						=			len(__lowerCamelCase		)
						for i in range(1			,     __lowerCamelCase		):
												_lowerCAmelCase  						=			collection[i]
												_lowerCAmelCase  						=			0
												_lowerCAmelCase  						=			i - 1

												while low <= high:
																		_lowerCAmelCase  						=			(low + high) // 2
																		if val < collection[mid]:
																								_lowerCAmelCase  						=			mid - 1
																		else:
																								_lowerCAmelCase  						=			mid + 1
												for j in range(__lowerCamelCase			,     __lowerCamelCase			,     -1		):
																		_lowerCAmelCase  						=			collection[j - 1]
												_lowerCAmelCase  						=			val
						return collection


if __name__ == "__main__":
						_lowercase    =		input("""Enter numbers separated by a comma:\n""").strip()
						_lowercase    =		[int(item) for item in user_input.split(""",""")]
						print(binary_insertion_sort(unsorted))


'''simple docstring'''



import os


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