
'''simple docstring'''

from __future__ import annotations







def __A  (    lowerCAmelCase_       ):
     for r in range(1 ,       lowerCAmelCase_       ):
          _UpperCAmelCase					:  Union[str, Any]         =    []
          for x in range(n - 1       ):
               _UpperCAmelCase					:  List[Any]         =    pow(lowerCAmelCase_ ,       lowerCAmelCase_ ,       lowerCAmelCase_       )
               if val in li:
                    break
               li.append(lowerCAmelCase_       )
          else:
               return r
     return None


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

      lowerCAmelCase_			:			Tuple			   =     pow(b_public, a_private, q)
      lowerCAmelCase_			:			Optional[Any]			   =     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)







'''simple docstring'''

def 		_snake_case		(					_SCREAMING_SNAKE_CASE     :						int = 4_000_000							)			->						int:







	"""simple docstring"""
	lowerCAmelCase    =	1
	lowerCAmelCase    =	2
	lowerCAmelCase    =	0
	while j <= n:
		if j % 2 == 0:
			total += j
		lowerCAmelCase,   lowerCAmelCase    =	j, i + j

	return total


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