


def 		_A		(		_lowercase )					-> list:


     """simple docstring"""


     if len(_lowercase ) <= 1:
          return lst

     __UpperCamelCase =			1

     while i < len(_lowercase ):
          if lst[i - 1] <= lst[i]:
               i += 1
          else:
               __UpperCamelCase,    __UpperCamelCase =			lst[i], lst[i - 1]
               i -= 1
               if i == 0:
                    __UpperCamelCase =			1

     return lst


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






'''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))




