




'''simple docstring'''



def 				SCREAMING_SNAKE_CASE_				(							__A       :				List[Any] ,  __A       :				Any ,  __A       :				Dict ,  __A       :				Union[str, Any]						)				->				int:
   if start == end:
      return start if lst[start] > item else start + 1
   if start > end:
      return start

   _SCREAMING_SNAKE_CASE =   (start + end) // 2
   if lst[mid] < item:
      return binary_search(__A ,  __A ,  mid + 1 ,  __A						)
   elif lst[mid] > item:
      return binary_search(__A ,  __A ,  __A ,  mid - 1						)
   else:
      return mid
def 				SCREAMING_SNAKE_CASE_				(							__A       :				Any						)				->				Optional[Any]:
   _SCREAMING_SNAKE_CASE =   len(__A						)

   for index in range(1 ,  __A						):
      _SCREAMING_SNAKE_CASE =   lst[index]
      _SCREAMING_SNAKE_CASE =   binary_search(__A ,  __A ,  0 ,  index - 1						)
      _SCREAMING_SNAKE_CASE =   lst[:pos] + [value] + lst[pos:index] + lst[index + 1 :]

   return lst
def 				SCREAMING_SNAKE_CASE_				(							__A       :				List[str] ,  __A       :				Any						)				->				List[str]:
   if not left:
      return right

   if not right:
      return left

   if left[0] < right[0]:
      return [left[0], *merge(left[1:] ,  __A						)]

   return [right[0], *merge(__A ,  right[1:]						)]
def 				SCREAMING_SNAKE_CASE_				(							__A       :				Any						)				->				Dict:
   _SCREAMING_SNAKE_CASE =   len(__A						)
   _SCREAMING_SNAKE_CASE, _SCREAMING_SNAKE_CASE =   [], []
   _SCREAMING_SNAKE_CASE =   [lst[0]]
   _SCREAMING_SNAKE_CASE =   []
   _SCREAMING_SNAKE_CASE =   1
   while i < length:
      if lst[i] < lst[i - 1]:
         runs.append(__A						)
         _SCREAMING_SNAKE_CASE =   [lst[i]]
      else:
         new_run.append(lst[i]						)
      i += 1
   runs.append(__A						)

   for run in runs:
      sorted_runs.append(insertion_sort(__A						)						)
   for run in sorted_runs:
      _SCREAMING_SNAKE_CASE =   merge(__A ,  __A						)

   return sorted_array
def 				SCREAMING_SNAKE_CASE_				(							)				->				Dict:
   _SCREAMING_SNAKE_CASE =   [5, 9, 10, 3, -4, 5, 1_78, 92, 46, -18, 0, 7]
   _SCREAMING_SNAKE_CASE =   tim_sort(__A						)
   print(__A						)


if __name__ == "__main__":
 main()







'''simple docstring'''



def 				SCREAMING_SNAKE_CASE_				(							__A       :				List[Any] ,  __A       :				Dict						)				->				Union[str, Any]:
   if n == 0:
      return 1

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

   else:
      _SCREAMING_SNAKE_CASE =   binary_exponentiation(__A ,  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}''')

