





def 						__SCREAMING_SNAKE_CASE  (    UpperCamelCase__ = 99_8001			)  ->    int:







			'''simple docstring'''

			for number in range(n - 1      ,      9999      ,      -1			):
						UpperCAmelCase       		=    str(UpperCamelCase__			)

						# checks whether 'str_number' is a palindrome.
						if str_number == str_number[::-1]:
									UpperCAmelCase       		=    999

									# 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 						__SCREAMING_SNAKE_CASE  (    UpperCamelCase__      ,      UpperCamelCase__      ,      UpperCamelCase__			)  ->    float:







			'''simple docstring'''

			if mass < 0:
						raise ValueError('''The mass of the body cannot be negative'''			)
			if radius <= 0:
						raise ValueError('''The radius is always a positive non zero integer'''			)
			return (mass * (velocity) ** 2) / radius


if __name__ == "__main__":
				import doctest

				doctest.testmod(verbose=True)



