




def 				UpperCAmelCase__  (							_A = 100      ,      _A = 100			):






  """simple docstring"""


  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()






import math






def 				UpperCAmelCase__  (							_A			):






  """simple docstring"""


  a_		    =  math.log(2      ,      10			) * number
  a_		    =  round((log_number - int(_A			))      ,      15			)

  return difference






def 				UpperCAmelCase__  (							_A = 678_910			):






  """simple docstring"""


  a_		    =  90
  a_		    =  0

  a_		    =  math.log(1.23      ,      10			)
  a_		    =  math.log(1.24      ,      10			)
  a_		    =  0

  while position < number:
    a_		    =  log_difference(_A			)

    if difference >= upper_limit:
      power_iterator += 93

    elif difference < lower_limit:
      power_iterator += 196

    else:
      a_		    =  power_iterator
      power_iterator += 196
      position += 1

  return previous_power


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  print(F"""{solution() = }""")
