




from copy import deepcopy
class        __snake_case  :



				def __init__(      self      :		Any		,	_UpperCAmelCase      :		list[int] | None = None		,	_UpperCAmelCase      :		int | None = None      )  ->    None:





								'''simple docstring'''




								if arr is None and size is not None:
												_lowerCAmelCase    :    int										=      size
												_lowerCAmelCase    :    Union[str, Any]										=      [0] * size
								elif arr is not None:
												self.init(_UpperCAmelCase      )
								else:
												raise ValueError("""Either arr or size must be specified"""      )



				def       SCREAMING_SNAKE_CASE       (      self      :		Optional[int]		,	_UpperCAmelCase      :		list[int]      )  ->    None:





								'''simple docstring'''




								_lowerCAmelCase    :    str										=      len(_UpperCAmelCase      )
								_lowerCAmelCase    :    List[Any]										=      deepcopy(_UpperCAmelCase      )
								for i in range(1		,	self.size      ):
												_lowerCAmelCase    :    List[str]										=      self.next_(_UpperCAmelCase      )
												if j < self.size:
																self.tree[j] += self.tree[i]



				def       SCREAMING_SNAKE_CASE       (      self      :		List[Any]      )  ->    list[int]:





								'''simple docstring'''




								_lowerCAmelCase    :    Any										=      self.tree[:]
								for i in range(self.size - 1		,	0		,	-1      ):
												_lowerCAmelCase    :    Optional[int]										=      self.next_(_UpperCAmelCase      )
												if j < self.size:
																arr[j] -= arr[i]
								return arr



				@staticmethod
				def       SCREAMING_SNAKE_CASE       (      _UpperCAmelCase      :		int      )  ->    int:





								'''simple docstring'''




								return index + (index & (-index))



				@staticmethod
				def       SCREAMING_SNAKE_CASE       (      _UpperCAmelCase      :		int      )  ->    int:





								'''simple docstring'''




								return index - (index & (-index))



				def       SCREAMING_SNAKE_CASE       (      self      :		str		,	_UpperCAmelCase      :		int		,	_UpperCAmelCase      :		int      )  ->    None:





								'''simple docstring'''




								if index == 0:
												self.tree[0] += value
												return
								while index < self.size:
												self.tree[index] += value
												_lowerCAmelCase    :    str										=      self.next_(_UpperCAmelCase      )



				def       SCREAMING_SNAKE_CASE       (      self      :		Dict		,	_UpperCAmelCase      :		int		,	_UpperCAmelCase      :		int      )  ->    None:





								'''simple docstring'''




								self.add(_UpperCAmelCase		,	value - self.get(_UpperCAmelCase      )      )



				def       SCREAMING_SNAKE_CASE       (      self      :		List[Any]		,	_UpperCAmelCase      :		int      )  ->    int:





								'''simple docstring'''




								if right == 0:
												return 0
								_lowerCAmelCase    :    Any										=      self.tree[0]
								right -= 1  # make right inclusive
								while right > 0:
												result += self.tree[right]
												_lowerCAmelCase    :    Optional[int]										=      self.prev(_UpperCAmelCase      )
								return result



				def       SCREAMING_SNAKE_CASE       (      self      :		int		,	_UpperCAmelCase      :		int		,	_UpperCAmelCase      :		int      )  ->    int:





								'''simple docstring'''




								return self.prefix(_UpperCAmelCase      ) - self.prefix(_UpperCAmelCase      )



				def       SCREAMING_SNAKE_CASE       (      self      :		Optional[int]		,	_UpperCAmelCase      :		int      )  ->    int:





								'''simple docstring'''




								return self.query(_UpperCAmelCase		,	index + 1      )



				def       SCREAMING_SNAKE_CASE       (      self      :		List[str]		,	_UpperCAmelCase      :		int      )  ->    int:





								'''simple docstring'''




								value -= self.tree[0]
								if value < 0:
												return -1

								_lowerCAmelCase    :    Any										=      1  # Largest power of 2 <= size
								while j * 2 < self.size:
												j *= 2

								_lowerCAmelCase    :    str										=      0

								while j > 0:
												if i + j < self.size and self.tree[i + j] <= value:
																value -= self.tree[i + j]
																i += j
												j //= 2
								return i


if __name__ == "__main__":
	import doctest

	doctest.testmod()







import sys

_lowerCamelCase      :  Optional[Any]      						=						(
    "73167176531330624919225119674426574742355349194934"
    "96983520312774506326239578318016984801869478851843"
    "85861560789112949495459501737958331952853208805511"
    "12540698747158523863050715693290963295227443043557"
    "66896648950445244523161731856403098711121722383113"
    "62229893423380308135336276614282806444486645238749"
    "30358907296290491560440772390713810515859307960866"
    "70172427121883998797908792274921901699720888093776"
    "65727333001053367881220235421809751254540594752243"
    "52584907711670556013604839586446706324415722155397"
    "53697817977846174064955149290862569321978468622482"
    "83972241375657056057490261407972968652414535100474"
    "82166370484403199890008895243450658541227588666881"
    "16427171479924442928230863465674813919123162824586"
    "17866458359124566529476545682848912883142607690042"
    "24219022671055626321111109370544217506941658960408"
    "07198403850962455444362981230987879927244284909188"
    "84580156166097919133875499200524063689912560717606"
    "05886116467109405077541002256983155200055935729725"
    "71636269561882670428252483600823257530420752963450"
)




def 							_UpperCAmelCase  (UpperCamelCase_ : str = N       ):
				'''simple docstring'''
				_lowerCAmelCase    :    List[str]										=      -sys.maxsize - 1
				for i in range(len(UpperCamelCase_       ) - 12       ):
								_lowerCAmelCase    :    List[str]										=      1
								for j in range(13       ):
												product *= int(n[i + j]       )
								if product > largest_product:
												_lowerCAmelCase    :    Any										=      product
				return largest_product


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

