





def   lowerCamelCase__   (   UpperCamelCase__	:				List[Any]				,			UpperCamelCase__	:				Any  )	->       Optional[int]:



					'''simple docstring'''




					if n == 0:
										return 1

					elif n % 2 == 1:
										return binary_exponentiation(SCREAMING_SNAKE_CASE_				,			n - 1  ) * a

					else:
										_snake_case													= binary_exponentiation(SCREAMING_SNAKE_CASE_				,			n / 2  )
										return b * b


if __name__ == "__main__":
					try:
										UpperCAmelCase_												=   int(input("""Enter Base : """).strip())
										UpperCAmelCase_												=   int(input("""Enter Power : """).strip())
					except ValueError:
										print("""Invalid literal for integer""")

					UpperCAmelCase_												=   binary_exponentiation(BASE, POWER)
					print(F"{BASE}^({POWER}) : {RESULT}")






def        lowerCAmelCase(	SCREAMING_SNAKE_CASE_       ,		SCREAMING_SNAKE_CASE_       )->		Tuple:



    """simple docstring"""






    if not root or root not in binary_tree_mirror_dictionary:
        return
    UpperCamelCase_   ,    UpperCamelCase_          =		binary_tree_mirror_dictionary[root][:2]
    UpperCamelCase_          =		[right_child, left_child]
    binary_tree_mirror_dict(SCREAMING_SNAKE_CASE_       ,		SCREAMING_SNAKE_CASE_       )
    binary_tree_mirror_dict(SCREAMING_SNAKE_CASE_       ,		SCREAMING_SNAKE_CASE_       )




def        lowerCAmelCase(	SCREAMING_SNAKE_CASE_       ,		SCREAMING_SNAKE_CASE_ = 1       )->		dict:



    """simple docstring"""






    if not binary_tree:
        raise ValueError("binary tree cannot be empty"       )
    if root not in binary_tree:
        UpperCamelCase_          =		f"root {root} is not present in the binary_tree"
        raise ValueError(SCREAMING_SNAKE_CASE_       )
    UpperCamelCase_          =		dict(SCREAMING_SNAKE_CASE_       )
    binary_tree_mirror_dict(SCREAMING_SNAKE_CASE_       ,		SCREAMING_SNAKE_CASE_       )
    return binary_tree_mirror_dictionary


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