






def      lowercase__      (     __snake_case    :							int     ,       __snake_case    :							int  ):


					'''simple docstring'''


					while b:
										UpperCAmelCase_       ,  UpperCAmelCase_    :      List[Any]            =						b, a % b
					return a




def      lowercase__      (     __snake_case    :							int     ,       __snake_case    :							int  ):


					'''simple docstring'''


					return a if b == 0 else euclidean_gcd_recursive(__snake_case     ,       a % b  )




def      lowercase__      (     ):


					'''simple docstring'''


					print(F"euclidean_gcd(3, 5) = {euclidean_gcd(3     ,       5  )}"  )
					print(F"euclidean_gcd(5, 3) = {euclidean_gcd(5     ,       3  )}"  )
					print(F"euclidean_gcd(1, 3) = {euclidean_gcd(1     ,       3  )}"  )
					print(F"euclidean_gcd(3, 6) = {euclidean_gcd(3     ,       6  )}"  )
					print(F"euclidean_gcd(6, 3) = {euclidean_gcd(6     ,       3  )}"  )

					print(F"euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3     ,       5  )}"  )
					print(F"euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5     ,       3  )}"  )
					print(F"euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1     ,       3  )}"  )
					print(F"euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3     ,       6  )}"  )
					print(F"euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6     ,       3  )}"  )


if __name__ == "__main__":
		main()














def      lowercase__      (     __snake_case    :							list  ):


					'''simple docstring'''


					for i in range(len(__snake_case  ) - 1     ,       0     ,       -1  ):
										UpperCAmelCase_    :      Dict            =						False

										for j in range(__snake_case     ,       0     ,       -1  ):
															if unsorted[j] < unsorted[j - 1]:
																				UpperCAmelCase_       ,  UpperCAmelCase_    :      Any            =						unsorted[j - 1], unsorted[j]
																				UpperCAmelCase_    :      int            =						True

										for j in range(__snake_case  ):
															if unsorted[j] > unsorted[j + 1]:
																				UpperCAmelCase_       ,  UpperCAmelCase_    :      Optional[int]            =						unsorted[j + 1], unsorted[j]
																				UpperCAmelCase_    :      Any            =						True

										if not swapped:
															break
					return unsorted


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		__UpperCAmelCase								=						input('Enter numbers separated by a comma:\n').strip()
		__UpperCAmelCase								=						[int(item) for item in user_input.split(',')]
		print(F'{cocktail_shaker_sort(unsorted) = }')






