






def    _lowerCamelCase		(  __A			:							int = 100						,						__A			:							int = 100       )					->    Union[str, Any]:
    return max(
        sum(int(A_       ) for x in str(base**power       )       )
        for base in range(A_       )
        for power in range(A_       )       )


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

  doctest.testmod()












"""simple docstring"""


def 			snake_case  (A_      :int = 1_0_0_0      ):







  '''simple docstring'''

  a     :			Union[str, Any]				=   0
  a     :			int				=   (n - 1) // 3
  total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
  a     :			Tuple				=   (n - 1) // 5
  total += ((terms) * (1_0 + (terms - 1) * 5)) // 2
  a     :			Dict				=   (n - 1) // 1_5
  total -= ((terms) * (3_0 + (terms - 1) * 1_5)) // 2
  return total


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




