




'''simple docstring'''





def     __magic_name__       (				A	:      list[int]     ):






			'''simple docstring'''







			if not numbers:
						return 0

			if not isinstance(A,						(list, tuple)     ) or not all(
			    isinstance(A,						A     ) for number in numbers     ):
						raise ValueError("numbers must be an iterable of integers"     )

			a					=    numbers[0]

			for i in range(1,						len(A     )     ):
						# update the maximum and minimum subarray products
						a					=    numbers[i]
						if number < 0:
									a					=    min_till_now, max_till_now
						a					=    max(A,						max_till_now * number     )
						a					=    min(A,						min_till_now * number     )

						# update the maximum product found till now
						a					=    max(A,						A     )

			return max_prod












def     __magic_name__       (				A	:      list     ):






			'''simple docstring'''







			for i in range(len(A     ) - 1,						0,						-1     ):
						a					=    False

						for j in range(A,						0,						-1     ):
									if unsorted[j] < unsorted[j - 1]:
												a					,	a					=    unsorted[j - 1], unsorted[j]
												a					=    True

						for j in range(A     ):
									if unsorted[j] > unsorted[j + 1]:
												a					,	a					=    unsorted[j + 1], unsorted[j]
												a					=    True

						if not swapped:
									break
			return unsorted


if __name__ == "__main__":
		import doctest

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






