




"""simple docstring"""





from __future__ import annotations

A				=							list[list[int]]

# assigning initial values to the grid
A				=							[
    [3, 0, 6, 5, 0, 8, 4, 0, 0],
    [5, 2, 0, 0, 0, 0, 0, 0, 0],
    [0, 8, 7, 0, 0, 0, 0, 3, 1],
    [0, 0, 3, 0, 1, 0, 0, 8, 0],
    [9, 0, 0, 8, 6, 3, 0, 0, 5],
    [0, 5, 0, 0, 9, 0, 6, 0, 0],
    [1, 3, 0, 0, 0, 0, 2, 5, 0],
    [0, 0, 0, 0, 0, 0, 0, 7, 4],
    [0, 0, 5, 2, 0, 6, 3, 0, 0],
]

# a grid with no solution
A				=							[
    [5, 0, 6, 5, 0, 8, 4, 0, 3],
    [5, 2, 0, 0, 0, 0, 0, 0, 2],
    [1, 8, 7, 0, 0, 0, 0, 3, 1],
    [0, 0, 3, 0, 1, 0, 0, 8, 0],
    [9, 0, 0, 8, 6, 3, 0, 0, 5],
    [0, 5, 0, 0, 9, 0, 6, 0, 0],
    [1, 3, 0, 0, 0, 0, 2, 5, 0],
    [0, 0, 0, 0, 0, 0, 0, 7, 4],
    [0, 0, 5, 2, 0, 6, 3, 0, 0],
]

def        _UpperCamelCase     (      UpperCamelCase					,							UpperCamelCase					,							UpperCamelCase					,							UpperCamelCase				)      ->      bool:


			"""simple docstring"""
			for i in range(9				):
						if grid[row][i] == n or grid[i][column] == n:
									return False

			for i in range(3				):
						for j in range(3				):
									if grid[(row - row % 3) + i][(column - column % 3) + j] == n:
												return False

			return True

def        _UpperCamelCase     (      UpperCamelCase				)      ->      tuple[int, int] | None:


			"""simple docstring"""
			for i in range(9				):
						for j in range(9				):
									if grid[i][j] == 0:
												return i, j
			return None

def        _UpperCamelCase     (      UpperCamelCase				)      ->      Matrix | None:


			"""simple docstring"""
			if location := find_empty_location(UpperCamelCase				):
						__UpperCAmelCase						,  __UpperCAmelCase						:			Dict												=       location
			else:
						# If the location is ``None``, then the grid is solved.
						return grid

			for digit in range(1					,							10				):
						if is_safe(UpperCamelCase					,							UpperCamelCase					,							UpperCamelCase					,							UpperCamelCase				):
									__UpperCAmelCase						:			Dict												=       digit

									if sudoku(UpperCamelCase				) is not None:
												return grid

									__UpperCAmelCase						:			Optional[Any]												=       0

			return None

def        _UpperCamelCase     (      UpperCamelCase				)      ->      None:


			"""simple docstring"""
			for row in grid:
						for cell in row:
									print(UpperCamelCase					,							end=" "				)
						print()


if __name__ == "__main__":
					# make a copy of grid so that you can compare with the unmodified grid
					for example_grid in (initial_grid, no_solution):
										print("""\nExample grid:\n""" + """=""" * 20)
										print_solution(example_grid)
										print("""\nExample grid solution:""")
										A				=							sudoku(example_grid)
										if solution is not None:
															print_solution(solution)
										else:
															print("""Cannot find a solution.""")






def   _lowercase(					__a				:						list[int]     ):
							a__      =len(__a     )
							for i in range(__a     ):
														for j in range(i + 1    ,     __a     ):
																					if numbers[j] < numbers[i]:
																												a__    ,     a__      =numbers[j], numbers[i]
							return numbers


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

