
'''simple docstring'''







from sympy import diff, lambdify, symbols
from sympy.functions import *  # noqa: F403
def  snake_case_		(    __SCREAMING_SNAKE_CASE :			str				,				__SCREAMING_SNAKE_CASE :			complex				,				__SCREAMING_SNAKE_CASE :			str = "x"				,				__SCREAMING_SNAKE_CASE :			float = 10**-10				,				__SCREAMING_SNAKE_CASE :			int = 1				,				):



						"""simple docstring"""





						lowercase_     :					Any													=	symbols(__SCREAMING_SNAKE_CASE							)
						lowercase_     :					Dict													=	lambdify(__SCREAMING_SNAKE_CASE				,				__SCREAMING_SNAKE_CASE							)
						lowercase_     :					Optional[int]													=	lambdify(__SCREAMING_SNAKE_CASE				,				diff(__SCREAMING_SNAKE_CASE				,				__SCREAMING_SNAKE_CASE							)							)

						lowercase_     :					Union[str, Any]													=	starting_point

						while True:
												if diff_function(__SCREAMING_SNAKE_CASE							) != 0:
																		lowercase_     :					Union[str, Any]													=	prev_guess - multiplicity * func(__SCREAMING_SNAKE_CASE							) / diff_function(
																		    __SCREAMING_SNAKE_CASE							)
												else:
																		raise ZeroDivisionError('''Could not find root'''							) from None

												# Precision is checked by comparing the difference of consecutive guesses
												if abs(next_guess - prev_guess							) < precision:
																		return next_guess

												lowercase_     :					List[Any]													=	next_guess


# Let's Execute
if __name__ == "__main__":
							# Find root of trigonometric function
							# Find value of pi
							print(f"""The root of sin(x) = 0 is {newton_raphson('sin(x)', 2)}""")

							# Find root of polynomial
							# Find fourth Root of 5
							print(f"""The root of x**4 - 5 = 0 is {newton_raphson('x**4 -5', 0.4 +5j)}""")

							# Find value of e
							print(
							    "The root of log(y) - 1 = 0 is ",
							    f"""{newton_raphson('log(y) - 1', 2, variable='y')}""",
							)

							# Exponential Roots
							print(
							    "The root of exp(x) - 1 = 0 is",
							    f"""{newton_raphson('exp(x) - 1', 1_0, precision=0.0_0_5)}""",
							)

							# Find root of cos(x)
							print(f"""The root of cos(x) = 0 is {newton_raphson('cos(x)', 0)}""")





'''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  snake_case_		(    __SCREAMING_SNAKE_CASE :			str							):



						"""simple docstring"""





						lowercase_     :					Any													=	1
						for digit in s:
												product *= int(__SCREAMING_SNAKE_CASE							)
						return product
def  snake_case_		(    __SCREAMING_SNAKE_CASE :			str = N							):



						"""simple docstring"""





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


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



