






"""simple docstring"""





def 					lowerCamelCase__	(							_lowerCamelCase	:		int = 100		,    _lowerCamelCase	:		int = 100			)				->    int:
		return max(
		    sum(int(_lowerCamelCase			) for x in str(base**power			)			)
		    for base in range(_lowerCamelCase			)
		    for power in range(_lowerCamelCase			)			)


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

		doctest.testmod()












"""simple docstring"""





def 					lowerCamelCase__	(							_lowerCamelCase	:		dict		,    _lowerCamelCase	:		int			)				->    int:
  if not root or root not in binary_tree_mirror_dictionary:
    return
  lowerCamelCase_					,     lowerCamelCase_   					=						binary_tree_mirror_dictionary[root][:2]
  lowerCamelCase_   					=						[right_child, left_child]
  binary_tree_mirror_dict(_lowerCamelCase		,    _lowerCamelCase			)
  binary_tree_mirror_dict(_lowerCamelCase		,    _lowerCamelCase			)







def 					lowerCamelCase__	(							_lowerCamelCase	:		dict		,    _lowerCamelCase	:		int = 1			)				->    dict:
  if not binary_tree:
    raise ValueError('binary tree cannot be empty'			)
  if root not in binary_tree:
    lowerCamelCase_   					=						F'''root {root} is not present in the binary_tree'''
    raise ValueError(_lowerCamelCase			)
  lowerCamelCase_   					=						dict(_lowerCamelCase			)
  binary_tree_mirror_dict(_lowerCamelCase		,    _lowerCamelCase			)
  return binary_tree_mirror_dictionary


if __name__ == "__main__":
  _SCREAMING_SNAKE_CASE :    Tuple    =						{1: [2, 3], 2: [4, 5], 3: [6, 7], 7: [8, 9]}
  print(F'''Binary tree: {binary_tree}''')
  _SCREAMING_SNAKE_CASE :    Dict    =						binary_tree_mirror(binary_tree, 5)
  print(F'''Binary tree mirror: {binary_tree_mirror_dictionary}''')




