






'''simple docstring'''







from math import factorial
def     A__      (					__lowerCAmelCase		:      int = 20    ):
						lowerCamelCase__								=	2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
						# 2, 3,...
						lowerCamelCase__								=	n // 2

						return int(factorial(__lowerCAmelCase    ) / (factorial(__lowerCAmelCase    ) * factorial(n - k    ))    )


if __name__ == "__main__":
							import sys

							if len(sys.argv) == 1:
														print(solution(20))
							else:
														try:
																					UpperCamelCase     :   Tuple	      =		int(sys.argv[1])
																					print(solution(n))
														except ValueError:
																					print('Invalid entry - please enter a number.')



"""simple docstring"""




def     __magic_name__      ( __snake_case							:			int	,					__snake_case							:			int    )					->							Any:
       if b == 0:
              return 1
       if (b % 2) == 0:
              return actual_power(__snake_case	,					int(b / 2    )    ) * actual_power(__snake_case	,					int(b / 2    )    )
       else:
              return a * actual_power(__snake_case	,					int(b / 2    )    ) * actual_power(__snake_case	,					int(b / 2    )    )


def     __magic_name__      ( __snake_case							:			int	,					__snake_case							:			int    )					->							float:
       if b < 0:
              return 1 / actual_power(__snake_case	,					__snake_case    )
       return actual_power(__snake_case	,					__snake_case    )


if __name__ == "__main__":
   print(power(-2, -3))


