
"""simple docstring"""



from functools import reduce

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






def 	__snake_case  (    SCREAMING_SNAKE_CASE:					str = N						):






							"""simple docstring"""



							return max(
							    # mypy cannot properly interpret reduce
							    int(reduce(lambda SCREAMING_SNAKE_CASE     ,  SCREAMING_SNAKE_CASE						: str(int(SCREAMING_SNAKE_CASE						) * int(SCREAMING_SNAKE_CASE						)						)     ,  n[i : i + 13]						)						)
							    for i in range(len(SCREAMING_SNAKE_CASE						) - 12						)						)


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








"""simple docstring"""



def 	__snake_case  (    SCREAMING_SNAKE_CASE:					str						):






							"""simple docstring"""



							_lowerCAmelCase  	=			0

							# if input_string is "aba" than new_input_string become "a|b|a"
							_lowerCAmelCase  	=			''
							_lowerCAmelCase  	=			''

							# append each character + "|" in new_string for range(0, length-1)
							for i in input_string[: len(SCREAMING_SNAKE_CASE						) - 1]:
														new_input_string += i + "|"
							# append last character
							new_input_string += input_string[-1]

							# we will store the starting and ending of previous furthest ending palindromic
							# substring
							_lowerCAmelCase	,		_lowerCAmelCase  	=			0, 0

							# length[i] shows the length of palindromic substring with center i
							_lowerCAmelCase  	=			[1 for i in range(len(SCREAMING_SNAKE_CASE						)						)]

							# for each character in new_string find corresponding palindromic string
							_lowerCAmelCase  	=			0
							for j in range(len(SCREAMING_SNAKE_CASE						)						):
														_lowerCAmelCase  	=			1 if j > r else min(length[l + r - j] // 2     ,  r - j + 1						)
														while (
														    j - k >= 0
														    and j + k < len(SCREAMING_SNAKE_CASE						)
														    and new_input_string[k + j] == new_input_string[j - k]
														):
																					k += 1

														_lowerCAmelCase  	=			2 * k - 1

														# does this string is ending after the previously explored end (that is r) ?
														# if yes the update the new r to the last index of this
														if j + k - 1 > r:
																					_lowerCAmelCase  	=			j - k + 1  # noqa: E741
																					_lowerCAmelCase  	=			j + k - 1

														# update max_length and start position
														if max_length < length[j]:
																					_lowerCAmelCase  	=			length[j]
																					_lowerCAmelCase  	=			j

    # create that string
							_lowerCAmelCase  	=			new_input_string[start - max_length // 2 : start + max_length // 2 + 1]
							for i in s:
														if i != "|":
																					output_string += i

							return output_string


if __name__ == "__main__":
	import doctest

	doctest.testmod()






