


'''simple docstring'''

def _SCREAMING_SNAKE_CASE (A			)			->			list:






       """simple docstring"""







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

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


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








'''simple docstring'''

from __future__ import annotations

lowerCamelCase				:  List[str]    		=      []

def _SCREAMING_SNAKE_CASE (A    ,					A    ,					A			)			->			bool:






       """simple docstring"""







       for i in range(len(A			)			):
              if board[row][i] == 1:
                     return False
       for i in range(len(A			)			):
              if board[i][column] == 1:
                     return False
       for i, j in zip(range(A    ,					-1    ,					-1			)    ,					range(A    ,					-1    ,					-1			)			):
              if board[i][j] == 1:
                     return False
       for i, j in zip(range(A    ,					-1    ,					-1			)    ,					range(A    ,					len(A			)			)			):
              if board[i][j] == 1:
                     return False
       return True

def _SCREAMING_SNAKE_CASE (A    ,					A			)			->			bool:






       """simple docstring"""







       if row >= len(A			):
              solution.append(A			)
              printboard(A			)
              print()
              return True
       for i in range(len(A			)			):
              if is_safe(A    ,					A    ,					A			):
                     lowercase__      =					1
                     solve(A    ,					row + 1			)
                     lowercase__      =					0
       return False

def _SCREAMING_SNAKE_CASE (A			)			->			None:






       """simple docstring"""







       for i in range(len(A			)			):
              for j in range(len(A			)			):
                     if board[i][j] == 1:
                            print('''Q'''    ,					end=''' '''			)
                     else:
                            print('''.'''    ,					end=''' '''			)
              print()


# n=int(input("The no. of queens"))
lowerCamelCase				:  Optional[Any]    		=      8
lowerCamelCase				:  Optional[int]    		=      [[0 for i in range(n)] for j in range(n)]
solve(board, 0)

print('The total no. of solutions are :', len(solution))




