


'''simple docstring'''



import sys

__lowercase      :		int			=      (
    '73167176531330624919225119674426574742355349194934'
    '96983520312774506326239578318016984801869478851843'
    '85861560789112949495459501737958331952853208805511'
    '12540698747158523863050715693290963295227443043557'
    '66896648950445244523161731856403098711121722383113'
    '62229893423380308135336276614282806444486645238749'
    '30358907296290491560440772390713810515859307960866'
    '70172427121883998797908792274921901699720888093776'
    '65727333001053367881220235421809751254540594752243'
    '52584907711670556013604839586446706324415722155397'
    '53697817977846174064955149290862569321978468622482'
    '83972241375657056057490261407972968652414535100474'
    '82166370484403199890008895243450658541227588666881'
    '16427171479924442928230863465674813919123162824586'
    '17866458359124566529476545682848912883142607690042'
    '24219022671055626321111109370544217506941658960408'
    '07198403850962455444362981230987879927244284909188'
    '84580156166097919133875499200524063689912560717606'
    '05886116467109405077541002256983155200055935729725'
    '71636269561882670428252483600823257530420752963450'
)






def     lowerCamelCase				(_SCREAMING_SNAKE_CASE :  str = N  ):
					__a     :			Union[str, Any]          =    -sys.maxsize - 1
					for i in range(len(_SCREAMING_SNAKE_CASE  ) - 12  ):
										__a     :			Optional[int]          =    1
										for j in range(13  ):
															product *= int(n[i + j]  )
										if product > largest_product:
															__a     :			Any          =    product
					return largest_product


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








'''simple docstring'''



lowerCAmelCase_  :							List[Any]             =    [0, 2, 4, 6, 8]
lowerCAmelCase_  :							str             =    [1, 3, 5, 7, 9]
def        UpperCAmelCase (    A	:					int       ,		A	:					int       ,		A	:					list[int]       ,		A	:					int					):
							if remaining_length == 0:
														if digits[0] == 0 or digits[-1] == 0:
																					return 0

														for i in range(length // 2 - 1       ,		-1       ,		-1					):
																					remainder += digits[i] + digits[length - i - 1]

																					if remainder % 2 == 0:
																												return 0

																					remainder //= 10

														return 1

							if remaining_length == 1:
														if remainder % 2 == 0:
																					return 0

														SCREAMING_SNAKE_CASE       :   List[Any]         =      0
														for digit in range(10					):
																					SCREAMING_SNAKE_CASE       :   Optional[Any]         =      digit
																					result += reversible_numbers(
																					    0       ,		(remainder + 2 * digit) // 10       ,		A       ,		A					)
														return result

							SCREAMING_SNAKE_CASE       :   List[str]         =      0
							for digita in range(10					):
														SCREAMING_SNAKE_CASE       :   int         =      digita

														if (remainder + digita) % 2 == 0:
																					SCREAMING_SNAKE_CASE       :   str         =      ODD_DIGITS
														else:
																					SCREAMING_SNAKE_CASE       :   List[str]         =      EVEN_DIGITS

														for digita in other_parity_digits:
																					SCREAMING_SNAKE_CASE       :   Union[str, Any]         =      digita
																					result += reversible_numbers(
																					    remaining_length - 2       ,		(remainder + digita + digita) // 10       ,		A       ,		A       ,		)
							return result
def        UpperCAmelCase (    A	:					int = 9					):
							SCREAMING_SNAKE_CASE       :   Union[str, Any]         =      0
							for length in range(1       ,		max_power + 1					):
														result += reversible_numbers(A       ,		0       ,		[0] * length       ,		A					)
							return result


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




