def 							lowerCAmelCase(	__lowerCamelCase      ,				__lowerCamelCase						):
					if n == 0:
										return 1

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

					else:
										__a							=   binary_exponentiation(__lowerCamelCase      ,				n / 2						)
										return b * b


if __name__ == "__main__":
	try:
		lowerCamelCase_				:		List[Any]       						=       int(input("""Enter Base : """).strip())
		lowerCamelCase_				:		Optional[Any]       						=       int(input("""Enter Power : """).strip())
	except ValueError:
		print("""Invalid literal for integer""")

	lowerCamelCase_				:		Optional[Any]       						=       binary_exponentiation(BASE, POWER)
	print(F'''{BASE}^({POWER}) : {RESULT}''')





def 							lowerCAmelCase(	__lowerCamelCase      ,				__lowerCamelCase						):
					sequence.append(__lowerCamelCase						)

					__a							=   0
					while sequence[index] != target:
										index += 1

					sequence.pop()

					if index == len(__lowerCamelCase						):
										return None

					return index


if __name__ == "__main__":
	lowerCamelCase_				:		List[str]       						=       input("""Enter numbers separated by comma:\n""").strip()
	lowerCamelCase_				:		str       						=       [int(item) for item in user_input.split(""",""")]

	lowerCamelCase_				:		Tuple       						=       input("""Enter a single number to be found in the list:\n""")
	lowerCamelCase_				:		Optional[int]       						=       int(target_input)
	lowerCamelCase_				:		List[Any]       						=       sentinel_linear_search(sequence, target)
	if result is not None:
		print(F'''{target} found at positions: {result}''')
	else:
		print("""Not found""")




