


from __future__ import annotations

SCREAMING_SNAKE_CASE							    =							list[list[int]]

# assigning initial values to the grid
SCREAMING_SNAKE_CASE							    =							[
    [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
SCREAMING_SNAKE_CASE							    =							[
    [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  a   (lowerCAmelCase__		,				lowerCAmelCase__		,				lowerCAmelCase__		,				lowerCAmelCase__   ):
   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  a   (lowerCAmelCase__   ):
   for i in range(9   ):
      for j in range(9   ):
         if grid[i][j] == 0:
            return i, j
   return None




def  a   (lowerCAmelCase__   ):
   if location := find_empty_location(lowerCAmelCase__   ):
      __a	,    __a					=  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__   ):
         __a					=  digit

         if sudoku(lowerCAmelCase__   ) is not None:
            return grid

         __a					=  0

   return None




def  a   (lowerCAmelCase__   ):
   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' + '=' * 2_0)
    print_solution(example_grid)
    print('\nExample grid solution:')
    SCREAMING_SNAKE_CASE							    =							sudoku(example_grid)
    if solution is not None:
      print_solution(solution)
    else:
      print('Cannot find a solution.')







def  a   (lowerCAmelCase__   ):
   __a					=  False
   while is_sorted is False:  # Until all the indices are traversed keep looping
      __a					=  True
      for i in range(0		,				len(lowerCAmelCase__   ) - 1		,				2   ):  # iterating over all even indices
         if input_list[i] > input_list[i + 1]:
            __a	,    __a					=  input_list[i + 1], input_list[i]
            # swapping if elements not in order
            __a					=  False

      for i in range(1		,				len(lowerCAmelCase__   ) - 1		,				2   ):  # iterating over all odd indices
         if input_list[i] > input_list[i + 1]:
            __a	,    __a					=  input_list[i + 1], input_list[i]
            # swapping if elements not in order
            __a					=  False
   return input_list


if __name__ == "__main__":
  print('Enter list to be sorted')
  SCREAMING_SNAKE_CASE							    =							[int(x) for x in input().split()]
  # inputing elements of the list in one line
  SCREAMING_SNAKE_CASE							    =							odd_even_sort(input_list)
  print('The sorted list is')
  print(sorted_list)



