code: 
  '''simple docstring'''
  def       _UpperCamelCase	(					SCREAMING_SNAKE_CASE__ = 99_8001 )     ->       int:
  
  
  		'''simple docstring'''
  
  
  		for number in range(n - 1   ,					9999   ,					-1 ):
  				snake_case     :					str     =	str(SCREAMING_SNAKE_CASE__ )
  
  				# checks whether 'str_number' is a palindrome.
  				if str_number == str_number[::-1]:
  						snake_case     :					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() = }")
  
  
  
style_context: 
  '''simple docstring'''
  def       _UpperCamelCase	(					)     ->       int:
  
  
  		'''simple docstring'''
  
  
  		for a in range(300 ):
  				for b in range(a + 1   ,					400 ):
  						for c in range(b + 1   ,					500 ):
  								if (a + b + c) == 1000 and (a**2) + (b**2) == (c**2):
  										return a * b * c
  
  		return -1
  
  
  
  
  def       _UpperCamelCase	(					)     ->       int:
  
  
  		'''simple docstring'''
  
  
  		for a in range(300 ):
  				for b in range(400 ):
  						snake_case     :					Dict     =	1000 - a - b
  						if a < b < c and (a**2) + (b**2) == (c**2):
  								return a * b * c
  
  		return -1
  
  
  
  
  def       _UpperCamelCase	(					)     ->       None:
  
  
  		'''simple docstring'''
  
  
  		import timeit
  
  		print(
  		    timeit.timeit('''solution()'''   ,					setup='''from __main__ import solution'''   ,					number=1000 ) )
  		print(
  		    timeit.timeit(
  		        '''solution_fast()'''   ,					setup='''from __main__ import solution_fast'''   ,					number=1000 ) )
  
  
  if __name__ == "__main__":
  						print(f"{solution() = }")
  
  
  