



def        __a     (    lowerCAmelCase_   :					str			,lowerCAmelCase_   :					Optional[Any]				)      -> List[Any]:






						'''simple docstring'''



						if n == 0:
												return 1

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

						else:
												UpperCAmelCase_=   binary_exponentiation(lowerCAmelCase_			,n / 2				)
												return b * b


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

	__A				    =						binary_exponentiation(BASE, POWER)
	print(f'{BASE}^({POWER}) : {RESULT}')









from __future__ import annotations



def        __a     (    lowerCAmelCase_   :					int				)      -> int | None:






						'''simple docstring'''



						for r in range(1			,lowerCAmelCase_				):
												UpperCAmelCase_=   []
												for x in range(n - 1				):
																		UpperCAmelCase_=   pow(lowerCAmelCase_			,lowerCAmelCase_			,lowerCAmelCase_				)
																		if val in li:
																								break
																		li.append(lowerCAmelCase_				)
												else:
																		return r
						return None


if __name__ == "__main__":
	__A				    =						int(input('''Enter a prime number q: '''))
	__A				    =						find_primitive(q)
	if a is None:
		print(f'Cannot find the primitive for the value: {a!r}')
	else:
		__A				    =						int(input('''Enter private key of A: '''))
		__A				    =						pow(a, a_private, q)
		__A				    =						int(input('''Enter private key of B: '''))
		__A				    =						pow(a, b_private, q)

		__A				    =						pow(b_public, a_private, q)
		__A				    =						pow(a_public, b_private, q)

		print('''The key value generated by A is: ''', a_secret)
		print('''The key value generated by B is: ''', b_secret)




