





def      a    (   _lowercase :  Dict = 9_9_8_0_0_1							)  ->int:
		UpperCamelCase__								=						0
		for i in range(9_9_9			,    9_9			,    -1							):  # 3 digit numbers range from 999 down to 100
				for j in range(9_9_9			,    9_9			,    -1							):
						UpperCamelCase__								=						str(i * j							)
						if product_string == product_string[::-1] and i * j < n:
								UpperCamelCase__								=						max(_SCREAMING_SNAKE_CASE			,    i * j							)
		return answer


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






"""simple docstring"""
def 		__a  (      _SCREAMING_SNAKE_CASE = 100						,	_SCREAMING_SNAKE_CASE = 100  )      ->int:
  return max(
      sum(int(_SCREAMING_SNAKE_CASE  ) for x in str(base**power  )  )
      for base in range(_SCREAMING_SNAKE_CASE  )
      for power in range(_SCREAMING_SNAKE_CASE  )  )


# Tests
if __name__ == "__main__":
 import doctest

 doctest.testmod()


