






from __future__ import annotations






def 			__UpperCamelCase	(		snake_case__					):
	if len(snake_case__					) == 0:
		return array

	A_		:						Optional[int]	    =   min(snake_case__					), max(snake_case__					)

	# Compute the variables
	A_		:						Optional[Any]	    =   _max - _min + 1
	A_		:						Any	    =   [0] * holes_range, [0] * holes_range

	# Make the sorting.
	for i in array:
		A_		:						Union[str, Any]	    =   i - _min
		A_		:						Optional[int]	    =   i
		holes_repeat[index] += 1

	# Makes the array back by replacing the numbers.
	A_		:						Optional[Any]	    =   0
	for i in range(snake_case__					):
		while holes_repeat[i] > 0:
			A_		:						str	    =   holes[i]
			index += 1
			holes_repeat[i] -= 1

    # Returns the sorted array.
	return array


if __name__ == "__main__":
							import doctest

							doctest.testmod()
							_lowerCAmelCase         =							input("Enter numbers separated by comma:\n")
							_lowerCAmelCase         =							[int(x) for x in user_input.split(",")]
							print(pigeon_sort(unsorted))









"""simple docstring"""
from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors






def 			__UpperCamelCase	(		snake_case__					):
	A_		:						List[str]	    =   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()

