






def 					snake_case_						(   lowerCAmelCase_				:  list					):
							for i in range(len(lowerCAmelCase_					) - 1				,				0				,				-1					):
														__lowercase					:							List[str]			=   False

														for j in range(lowerCAmelCase_				,				0				,				-1					):
																					if unsorted[j] < unsorted[j - 1]:
																												__lowercase	,	__lowercase					:							List[str]			=   unsorted[j - 1], unsorted[j]
																												__lowercase					:							List[str]			=   True

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

														if not swapped:
																					break
							return unsorted


if __name__ == "__main__":
	import doctest

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







from maths.prime_check import is_prime
def 					snake_case_						(   lowerCAmelCase_				:  int					):
							if not isinstance(lowerCAmelCase_				,				lowerCAmelCase_					):
														__lowercase					:							Dict			=   F"Input value of [number={number}] must be an integer"
														raise TypeError(lowerCAmelCase_					)
							if is_prime(lowerCAmelCase_					) and is_prime(number + 2					):
														return number + 2
							else:
														return -1


if __name__ == "__main__":
	import doctest

	doctest.testmod()