


'''simple docstring'''



def       _UpperCamelCase (						UpperCamelCase__	, UpperCamelCase__   ):
			if b == 0:
						return 1
			if (b % 2) == 0:
						return actual_power(UpperCamelCase__	, int(b / 2   )   ) * actual_power(UpperCamelCase__	, int(b / 2   )   )
			else:
						return a * actual_power(UpperCamelCase__	, int(b / 2   )   ) * actual_power(UpperCamelCase__	, int(b / 2   )   )







def       _UpperCamelCase (						UpperCamelCase__	, UpperCamelCase__   ):
			if b < 0:
						return 1 / actual_power(UpperCamelCase__	, UpperCamelCase__   )
			return actual_power(UpperCamelCase__	, UpperCamelCase__   )


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



'''simple docstring'''



def       _UpperCamelCase (						UpperCamelCase__   ):
			UpperCAmelCase__					:   List[str]       				=       len(UpperCamelCase__   )
			UpperCAmelCase__					:   List[Any]       				=       sum(UpperCamelCase__   )

			UpperCAmelCase__					:   List[str]       				=       [[False for x in range(s + 1   )] for y in range(n + 1   )]

			for i in range(1	, n + 1   ):
						UpperCAmelCase__					:   int       				=       True

			for i in range(1	, s + 1   ):
						UpperCAmelCase__					:   Dict       				=       False

			for i in range(1	, n + 1   ):
						for j in range(1	, s + 1   ):
									UpperCAmelCase__					:   int       				=       dp[i][j - 1]

									if arr[i - 1] <= j:
												UpperCAmelCase__					:   str       				=       dp[i][j] or dp[i - 1][j - arr[i - 1]]

			for j in range(int(s / 2   )	, -1	, -1   ):
						if dp[n][j] is True:
									UpperCAmelCase__					:   int       				=       s - 2 * j
									break

			return diff