



from __future__ import annotations






def  lowerCamelCase_	(      lowerCAmelCase__	:	list[int]				)       ->							list[int]:

							'''simple docstring'''






							if len(lowerCAmelCase__				) == 0:
														return array

							A						,   A      						=    min(lowerCAmelCase__				), max(lowerCAmelCase__				)

							# Compute the variables
							A      						=    _max - _min + 1
							A						,   A      						=    [0] * holes_range, [0] * holes_range

							# Make the sorting.
							for i in array:
														A      						=    i - _min
														A      						=    i
														holes_repeat[index] += 1

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

    # Returns the sorted array.
							return array


if __name__ == "__main__":
				import doctest

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

"""simple docstring"""


from __future__ import annotations






def    _snake_case					(		snake_case__ :  tuple[int, int]						,   snake_case__ :  int  ):
	A ,   A     = position
	A     = [
	    (y + 1, x + 2),
	    (y - 1, x + 2),
	    (y + 1, x - 2),
	    (y - 1, x - 2),
	    (y + 2, x + 1),
	    (y + 2, x - 1),
	    (y - 2, x + 1),
	    (y - 2, x - 1),
	]
	A     = []

	for position in positions:
		A ,   A     = position
		if 0 <= y_test < n and 0 <= x_test < n:
			permissible_positions.append(snake_case__  )

	return permissible_positions






def    _snake_case					(		snake_case__ :  list[list[int]]  ):
	return not any(elem == 0 for row in board for elem in row  )






def    _snake_case					(		snake_case__ :  list[list[int]]						,   snake_case__ :  tuple[int, int]						,   snake_case__ :  int  ):

	if is_complete(snake_case__  ):
		return True

	for position in get_valid_pos(snake_case__						,   len(snake_case__  )  ):
		A ,   A     = position

		if board[y][x] == 0:
			A     = curr + 1
			if open_knight_tour_helper(snake_case__						,   snake_case__						,   curr + 1  ):
				return True
			A     = 0

	return False






def    _snake_case					(		snake_case__ :  int  ):
	A     = [[0 for i in range(snake_case__  )] for j in range(snake_case__  )]

	for i in range(snake_case__  ):
		for j in range(snake_case__  ):
			A     = 1
			if open_knight_tour_helper(snake_case__						,   (i, j)						,   1  ):
				return board
			A     = 0

	A     = F'Open Kight Tour cannot be performed on a board of size {n}'
	raise ValueError(snake_case__  )


if __name__ == "__main__":
		import doctest

		doctest.testmod()