




def  snake_case_					(		SCREAMING_SNAKE_CASE_ = 99_80_01    )      ->			int:

							# fetches the next number
							for number in range(n - 1    ,99_99    ,-1    ):
														lowercase__  :	str        =							str(SCREAMING_SNAKE_CASE_    )

														# checks whether 'str_number' is a palindrome.
														if str_number == str_number[::-1]:
																					lowercase__  :	List[str]        =							9_99

																					# if 'number' is a product of two 3-digit numbers
																					# then number is the answer otherwise fetch next number.
																					while divisor != 99:
																												if (number % divisor == 0) and (len(str(number // divisor    )    ) == 3.0):
																																			return number
																												divisor -= 1
							raise ValueError("That number is larger than our acceptable range."    )


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





def  snake_case_					(		)      ->			int:

							for a in range(3_00    ):
														for b in range(a + 1    ,4_00    ):
																					for c in range(b + 1    ,5_00    ):
																												if (a + b + c) == 10_00 and (a**2) + (b**2) == (c**2):
																																			return a * b * c

							return -1
def  snake_case_					(		)      ->			int:

							for a in range(3_00    ):
														for b in range(4_00    ):
																					lowercase__  :	Dict        =							10_00 - a - b
																					if a < b < c and (a**2) + (b**2) == (c**2):
																												return a * b * c

							return -1
def  snake_case_					(		)      ->			None:
							import timeit

							print(
							    timeit.timeit("solution()"    ,setup="from __main__ import solution"    ,number=10_00    )    )
							print(
							    timeit.timeit(
							        "solution_fast()"    ,setup="from __main__ import solution_fast"    ,number=10_00    )    )


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