






def 	__lowerCamelCase      (		snake_case__		)							->  list:






						"""simple docstring"""





						if len(snake_case__		) < 2:
												return collection

						def circle_sort_util(snake_case__	,snake_case__	,snake_case__		) -> bool:
												_SCREAMING_SNAKE_CASE     				=  False

												if low == high:
																		return swapped

												_SCREAMING_SNAKE_CASE     				=  low
												_SCREAMING_SNAKE_CASE     				=  high

												while left < right:
																		if collection[left] > collection[right]:
																								_SCREAMING_SNAKE_CASE				,					_SCREAMING_SNAKE_CASE     				=  (
																								    collection[right],
																								    collection[left],
																								)
																								_SCREAMING_SNAKE_CASE     				=  True

																		left += 1
																		right -= 1

												if left == right and collection[left] > collection[right + 1]:
																		_SCREAMING_SNAKE_CASE				,					_SCREAMING_SNAKE_CASE     				=  (
																		    collection[right + 1],
																		    collection[left],
																		)

																		_SCREAMING_SNAKE_CASE     				=  True

												_SCREAMING_SNAKE_CASE     				=  low + int((high - low) / 2		)
												_SCREAMING_SNAKE_CASE     				=  circle_sort_util(snake_case__	,snake_case__	,snake_case__		)
												_SCREAMING_SNAKE_CASE     				=  circle_sort_util(snake_case__	,mid + 1	,snake_case__		)

												return swapped or left_swap or right_swap

						_SCREAMING_SNAKE_CASE     				=  True

						while is_not_sorted is True:
												_SCREAMING_SNAKE_CASE     				=  circle_sort_util(snake_case__	,0	,len(snake_case__		) - 1		)

						return collection


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









from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE     				=  prime_factors(snake_case__		)
						if is_square_free(snake_case__		):
												return -1 if len(snake_case__		) % 2 else 1
						return 0


if __name__ == "__main__":
		import doctest

		doctest.testmod()

