

'''simple docstring'''




def 						UpperCamelCase       ( a		,						a )      ->	Dict:






     '''simple docstring'''
     if n == 0:
          return 1

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

     else:
          __magic_name__						   =				binary_exponentiation(_SCREAMING_SNAKE_CASE		,						n / 2 )
          return b * b


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

      _lowerCAmelCase    			=						binary_exponentiation(BASE, POWER)
      print(F'''{BASE}^({POWER}) : {RESULT}''')











'''simple docstring'''

from __future__ import annotations






def 		_snake_case		(					_SCREAMING_SNAKE_CASE     :						list[int]							,		_SCREAMING_SNAKE_CASE     :						int							)			->						list[int]:







	"""simple docstring"""
	lowerCAmelCase    =	{}
	for index, val in enumerate(_SCREAMING_SNAKE_CASE							):
		lowerCAmelCase    =	target - val
		if compl in chk_map:
			return [chk_map[compl], index]
		lowerCAmelCase    =	index
	return []


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				print(F'''{two_sum([2, 7, 11, 15], 9) = }''')