
'''simple docstring'''







import numpy as np
def       snake_case_	(       __SCREAMING_SNAKE_CASE      :				Union[str, Any]							):



						"""simple docstring"""





						lowercase_			:  Optional[Any]									= np.exp(__SCREAMING_SNAKE_CASE							)

						# Add up the all the exponentials
						lowercase_			:  Optional[Any]									= np.sum(__SCREAMING_SNAKE_CASE							)

						# Divide every exponent by the sum of all exponents
						lowercase_			:  Optional[int]									= exponent_vector / sum_of_exponents

						return softmax_vector


if __name__ == "__main__":
							print(softmax((0,)))






'''simple docstring'''







def       snake_case_	(       __SCREAMING_SNAKE_CASE      :				int = 998001							):



						"""simple docstring"""





						lowercase_			:  Dict									= 0
						for i in range(999   ,   99   ,   -1							):  # 3 digit numbers range from 999 down to 100
												for j in range(999   ,   99   ,   -1							):
																		lowercase_			:  int									= str(i * j							)
																		if product_string == product_string[::-1] and i * j < n:
																								lowercase_			:  str									= max(__SCREAMING_SNAKE_CASE   ,   i * j							)
						return answer


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



