






def 						__UpperCAmelCase      (					a_):
							return n * (2 * n - 1)





def 						__UpperCAmelCase      (					a_):
							snake_case_           =							(1 + 24 * n) ** 0.5
							return ((1 + root) / 6) % 1 == 0





def 						__UpperCAmelCase      (					a_ = 1_44):
							snake_case_           =							start
							snake_case_           =							hexagonal_num(a_)
							while not is_pentagonal(a_):
														n += 1
														snake_case_           =							hexagonal_num(a_)
							return num


if __name__ == "__main__":
	print(f'{solution()} = ')













from __future__ import annotations





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


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

		lowercase  							= pow(b_public, a_private, q)
		lowercase  							= 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)





