
import sys

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




def 				a						(							snake_case__:					str = N					):


				'''simple docstring'''
				lowercase_       =					-sys.maxsize - 1
				for i in range(len(snake_case__					) - 12					):
								lowercase_       =					1
								for j in range(13					):
												product *= int(n[i + j]					)
								if product > largest_product:
												lowercase_       =					product
				return largest_product


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






"""simple docstring"""





from __future__ import annotations

__magic_name__       =			[-10, -5, 0, 5, 5.1, 11, 13, 21, 3, 4, -21, -10, -5, -1, 0]
__magic_name__       =			[-5, 0, 5, 5.1, 11, 13, 21, -1, 4, -1, -10, -5, -1, 0, -1]



def 						_lowerCAmelCase				(				UpperCamelCase_				):
		__SCREAMING_SNAKE_CASE            = []
		__SCREAMING_SNAKE_CASE            = len(UpperCamelCase_				)

		for i in range(UpperCamelCase_				):
				__SCREAMING_SNAKE_CASE            = -1
				for j in range(i + 1  ,				UpperCamelCase_				):
						if arr[i] < arr[j]:
								__SCREAMING_SNAKE_CASE            = arr[j]
								break
				result.append(UpperCamelCase_				)
		return result



def 						_lowerCAmelCase				(				UpperCamelCase_				):
		__SCREAMING_SNAKE_CASE            = []
		for i, outer in enumerate(UpperCamelCase_				):
				__SCREAMING_SNAKE_CASE            = -1
				for inner in arr[i + 1 :]:
						if outer < inner:
								__SCREAMING_SNAKE_CASE            = inner
								break
				result.append(UpperCamelCase_				)
		return result



def 						_lowerCAmelCase				(				UpperCamelCase_				):
		__SCREAMING_SNAKE_CASE            = len(UpperCamelCase_				)
		__SCREAMING_SNAKE_CASE            = []
		__SCREAMING_SNAKE_CASE            = [-1] * arr_size

		for index in reversed(range(UpperCamelCase_				)				):
				if stack:
						while stack[-1] <= arr[index]:
								stack.pop()
								if not stack:
										break
				if stack:
						__SCREAMING_SNAKE_CASE            = stack[-1]
				stack.append(arr[index]				)
		return result


if __name__ == "__main__":
							from doctest import testmod
							from timeit import timeit

							testmod()
							print(next_greatest_element_slow(arr))
							print(next_greatest_element_fast(arr))
							print(next_greatest_element(arr))

							__magic_name__       =			(
							    "from __main__ import arr, next_greatest_element_slow, "
							    "next_greatest_element_fast, next_greatest_element"
							)
							print(
							    "next_greatest_element_slow():",
							    timeit("next_greatest_element_slow(arr)", setup=setup),
							)
							print(
							    "next_greatest_element_fast():",
							    timeit("next_greatest_element_fast(arr)", setup=setup),
							)
							print(
							    "     next_greatest_element():",
							    timeit("next_greatest_element(arr)", setup=setup),
							)




