



import random



def 		__a  (					lowerCAmelCase_     :      Optional[int]       )   ->				Optional[int]:






						'''simple docstring'''



						def is_sorted(lowerCAmelCase_     :      Any       ):
												for i in range(len(lowerCAmelCase_       ) - 1       ):
																		if collection[i] > collection[i + 1]:
																								return False
												return True

						while not is_sorted(lowerCAmelCase_       ):
												random.shuffle(lowerCAmelCase_       )
						return collection


if __name__ == "__main__":
	__A       					=		input('''Enter numbers separated by a comma:\n''').strip()
	__A       					=		[int(item) for item in user_input.split(''',''')]
	print(bogo_sort(unsorted))









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)




