


'''simple docstring'''
import sys

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


def 			a      (			__a   )  ->	int:



					'''simple docstring'''






					UpperCamelCase__   :str												= 1
					for digit in s:
										product *= int(a__   )
					return product


def 			a      (			__a = N   )  ->	int:



					'''simple docstring'''






					UpperCamelCase__   :List[str]												= -sys.maxsize - 1
					UpperCamelCase__   :int												= n[:13]
					UpperCamelCase__   :int												= 13
					while cur_index < len(a__   ) - 13:
										if int(n[cur_index]   ) >= int(substr[0]   ):
															UpperCamelCase__   :List[str]												= substr[1:] + n[cur_index]
															cur_index += 1
										else:
															UpperCamelCase__   :Tuple												= max(a__ ,					str_eval(a__   )   )
															UpperCamelCase__   :List[str]												= n[cur_index : cur_index + 13]
															cur_index += 13
					return largest_product


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

def     __lowerCAmelCase			(			a__  )       ->  str:
				__a										=    []
				__a										=    set({'''(''', '''[''', '''{'''}  )
				__a										=    set({''')''', ''']''', '''}'''}  )
				__a										=    {'''{''': '''}''', '''[''': ''']''', '''(''': ''')'''}

				for i in range(len(a__  )  ):
								if s[i] in open_brackets:
												stack.append(s[i]  )

								elif s[i] in closed_brackets and (
								    len(a__  ) == 0 or (len(a__  ) > 0 and open_to_closed[stack.pop()] != s[i])
								):
												return False

				return len(a__  ) == 0


def     __lowerCAmelCase			(			)       ->  Dict:
				__a										=    input('''Enter sequence of brackets: '''  )
				if is_balanced(a__  ):
								print(a__						,    '''is balanced'''  )
				else:
								print(a__						,    '''is not balanced'''  )


if __name__ == "__main__":
					main()