def    lowerCamelCase_   (  _lowercase = 998_001    )							->	int:

		# fetches the next number
		for number in range(n - 1 ,     9_999 ,     -1    ):
				__A							:   int	  =				str(_lowercase    )

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






import os



def    lowerCamelCase_   (  )							->	List[str]:
		__A							:   Any	  =				0
		__A							:   Any	  =				0
		with open(os.path.dirname(_lowercase    ) + "/p022_names.txt"    ) as file:
				__A							:   int	  =				str(file.readlines()[0]    )
				__A							:   Optional[Any]	  =				name.replace("\"" ,     ""    ).split(","    )

		name.sort()
		for i in range(len(_lowercase    )    ):
				for j in name[i]:
						temp_sum += ord(_lowercase    ) - ord("A"    ) + 1
				total_sum += (i + 1) * temp_sum
				__A							:   List[Any]	  =				0
		return total_sum


if __name__ == "__main__":
					print(solution())





