


'''simple docstring'''



def   lowerCamelCase							(_SCREAMING_SNAKE_CASE				:       List[Any]						,				_SCREAMING_SNAKE_CASE				:       List[str]       ):
					# "extended trapezoidal rule"
					# int(f) = dx/2 * (f1 + 2f2 + ... + fn)
					__a      :	Tuple    =  (boundary[1] - boundary[0]) / steps
					__a      :	Optional[int]    =  boundary[0]
					__a      :	Union[str, Any]    =  boundary[1]
					__a      :	List[Any]    =  make_points(_SCREAMING_SNAKE_CASE						,				_SCREAMING_SNAKE_CASE						,				_SCREAMING_SNAKE_CASE       )
					__a      :	Optional[Any]    =  0.0
					y += (h / 2.0) * f(_SCREAMING_SNAKE_CASE       )
					for i in x_i:
										# print(i)
										y += h * f(_SCREAMING_SNAKE_CASE       )
					y += (h / 2.0) * f(_SCREAMING_SNAKE_CASE       )
					return y






def   lowerCamelCase							(_SCREAMING_SNAKE_CASE				:       Union[str, Any]						,				_SCREAMING_SNAKE_CASE				:       int						,				_SCREAMING_SNAKE_CASE				:       Any       ):
					__a      :	List[Any]    =  a + h
					while x < (b - h):
										yield x
										__a      :	List[Any]    =  x + h






def   lowerCamelCase							(_SCREAMING_SNAKE_CASE				:       Tuple       ):  # enter your function here
					__a      :	Dict    =  (x - 0) * (x - 0)
					return y






def   lowerCamelCase							():
					__a      :	Optional[Any]    =  0.0  # Lower bound of integration
					__a      :	str    =  1.0  # Upper bound of integration
					__a      :	Any    =  1_0.0  # define number of steps or resolution
					__a      :	Optional[Any]    =  [a, b]  # define boundary of integration
					__a      :	List[Any]    =  method_a(_SCREAMING_SNAKE_CASE						,				_SCREAMING_SNAKE_CASE       )
					print(F"""y = {y}"""       )


if __name__ == "__main__":
	main()







'''simple docstring'''



import sys

__lowercase     :						Union[str, Any]	=     (
    '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       ):
					__a      :	List[str]    =  1
					for digit in s:
										product *= int(_SCREAMING_SNAKE_CASE       )
					return product






def   lowerCamelCase							(_SCREAMING_SNAKE_CASE				:       str = N       ):
					__a      :	Optional[int]    =  -sys.maxsize - 1
					__a      :	Optional[Any]    =  n[:13]
					__a      :	int    =  13
					while cur_index < len(_SCREAMING_SNAKE_CASE       ) - 13:
										if int(n[cur_index]       ) >= int(substr[0]       ):
															__a      :	List[Any]    =  substr[1:] + n[cur_index]
															cur_index += 1
										else:
															__a      :	Dict    =  max(_SCREAMING_SNAKE_CASE						,				str_eval(_SCREAMING_SNAKE_CASE       )       )
															__a      :	Optional[Any]    =  n[cur_index : cur_index + 13]
															cur_index += 13
					return largest_product


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



