






import decimal



def        _lowerCamelCase(      ):





				'''simple docstring'''







				SCREAMING_SNAKE_CASE_ :						str    				= 0
				SCREAMING_SNAKE_CASE_ :						Optional[Any]    				= decimal.Context(prec=105   )
				for i in range(2     ,     100   ):
								SCREAMING_SNAKE_CASE_ :						List[Any]    				= decimal.Decimal(lowerCAmelCase__   )
								SCREAMING_SNAKE_CASE_ :						int    				= number.sqrt(lowerCAmelCase__   )
								if len(str(lowerCAmelCase__   )   ) > 1:
												answer += int(str(lowerCAmelCase__   )[0]   )
												SCREAMING_SNAKE_CASE_ :						int    				= str(lowerCAmelCase__   )[2:101]
												answer += sum(int(lowerCAmelCase__   ) for x in sqrt_number_str   )
				return answer


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				print(f"""{solution() = }""")







def        _lowerCamelCase(      lowerCAmelCase__					:		int = 99_8001   ):





				'''simple docstring'''







				for number in range(n - 1     ,     9999     ,     -1   ):
								SCREAMING_SNAKE_CASE_ :						int    				= str(lowerCAmelCase__   )

								# checks whether 'str_number' is a palindrome.
								if str_number == str_number[::-1]:
												SCREAMING_SNAKE_CASE_ :						str    				= 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() = }""")