



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






						'''simple docstring'''



						UpperCAmelCase_=   (boundary[1] - boundary[0]) / steps
						UpperCAmelCase_=   boundary[0]
						UpperCAmelCase_=   boundary[1]
						UpperCAmelCase_=   make_points(lowerCAmelCase_			,lowerCAmelCase_			,lowerCAmelCase_				)
						UpperCAmelCase_=   0.0
						y += (h / 3.0) * f(lowerCAmelCase_				)
						UpperCAmelCase_=   2
						for i in x_i:
												y += (h / 3) * (4 - 2 * (cnt % 2)) * f(lowerCAmelCase_				)
												cnt += 1
						y += (h / 3.0) * f(lowerCAmelCase_				)
						return y



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






						'''simple docstring'''



						UpperCAmelCase_=   a + h
						while x < (b - h):
												yield x
												UpperCAmelCase_=   x + h



def        __a     (    lowerCAmelCase_   :					List[str]				)      -> Optional[int]:  # enter your function here






						'''simple docstring'''



						UpperCAmelCase_=   (x - 0) * (x - 0)
						return y



def        __a     (    )      -> Union[str, Any]:






						'''simple docstring'''



						UpperCAmelCase_=   0.0  # Lower bound of integration
						UpperCAmelCase_=   1.0  # Upper bound of integration
						UpperCAmelCase_=   10.0  # define number of steps or resolution
						UpperCAmelCase_=   [a, b]  # define boundary of integration
						UpperCAmelCase_=   method_a(lowerCAmelCase_			,lowerCAmelCase_				)
						print(F"""y = {y}"""				)


if __name__ == "__main__":
	main()









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)




