



"""simple docstring"""


from __future__ import annotations

__A      :							Union[str, Any]   =      list[list[int]]

# assigning initial values to the grid
__A      :							Matrix   =      [
    [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      :							Matrix   =      [
    [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        lowercase		(					_SCREAMING_SNAKE_CASE      :  Optional[Any]    ,   _SCREAMING_SNAKE_CASE      :  Optional[Any]    ,   _SCREAMING_SNAKE_CASE      :  List[Any]    ,   _SCREAMING_SNAKE_CASE      :  int ):






				'''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        lowercase		(					_SCREAMING_SNAKE_CASE      :  int ):






				'''simple docstring'''



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







def        lowercase		(					_SCREAMING_SNAKE_CASE      :  Union[str, Any] ):






				'''simple docstring'''



				if location := find_empty_location(__lowerCamelCase ):
								_UpperCAmelCase						,  _UpperCAmelCase							=			location
				else:
								# If the location is ``None``, then the grid is solved.
								return grid

				for digit in range(1    ,   10 ):
								if is_safe(__lowerCamelCase    ,   __lowerCamelCase    ,   __lowerCamelCase    ,   __lowerCamelCase ):
												_UpperCAmelCase							=			digit

												if sudoku(__lowerCamelCase ) is not None:
																return grid

												_UpperCAmelCase							=			0

				return None







def        lowercase		(					_SCREAMING_SNAKE_CASE      :  Optional[Any] ):






				'''simple docstring'''



				for row in grid:
								for cell in row:
												print(__lowerCamelCase    ,   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      :							Any   =      sudoku(example_grid)
										if solution is not None:
															print_solution(solution)
										else:
															print("Cannot find a solution.")









from __future__ import annotations





def 		__A		(	__lowerCamelCase							,			__lowerCamelCase    )      ->       float:
	a										=							sorted(numsa + numsa    )
	a				, a										=							divmod(len(__lowerCamelCase    )							,			2    )
	if mod == 1:
		return all_numbers[div]
	else:
		return (all_numbers[div] + all_numbers[div - 1]) / 2


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		__UpperCamelCase					:       Tuple    					=      [float(x) for x in input("Enter the elements of first array: ").split()]
		__UpperCamelCase					:       List[Any]    					=      [float(x) for x in input("Enter the elements of second array: ").split()]
		print(F'The median of two arrays is: {median_of_two_arrays(array_a, array_a)}')

