





def    __snake_case  (    _lowerCAmelCase       :       list		)       ->  Optional[int]:
   if len(_snake_case		) <= 1:
      return lst

   A_    : Any								=	1

   while i < len(_snake_case		):
      if lst[i - 1] <= lst[i]:
         i += 1
      else:
         A_    : Tuple								=	lst[i], lst[i - 1]
         i -= 1
         if i == 0:
            A_    : List[str]								=	1

   return lst


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




"""simple docstring"""





from __future__ import annotations

from decimal import Decimal

from numpy import array


def    _snake_case  (  _snake_case :	list[list[float]]	):
      lowerCAmelCase    :		str				=      Decimal

      # Check if the provided matrix has 2 rows and 2 columns
      # since this implementation only works for 2x2 matrices
      if len(_snake_case	) == 2 and len(matrix[0]	) == 2 and len(matrix[1]	) == 2:
            # Calculate the determinant of the matrix
            lowerCAmelCase    :		int				=      float(
                d(matrix[0][0]	) * d(matrix[1][1]	) - d(matrix[1][0]	) * d(matrix[0][1]	)	)
            if determinant == 0:
                  raise ValueError('''This matrix has no inverse.'''	)

            # Creates a copy of the matrix with swapped positions of the elements
            lowerCAmelCase    :		Optional[int]				=      [[0.0, 0.0], [0.0, 0.0]]
            lowerCAmelCase,					lowerCAmelCase    :		List[Any]				=      matrix[1][1], matrix[0][0]
            lowerCAmelCase,					lowerCAmelCase    :		Union[str, Any]				=      -matrix[1][0], -matrix[0][1]

            # Calculate the inverse of the matrix
            return [
                [(float(d(_snake_case	)	) / determinant) or 0.0 for n in row] for row in swapped_matrix
            ]
      elif (
          len(_snake_case	) == 3
          and len(matrix[0]	) == 3
          and len(matrix[1]	) == 3
          and len(matrix[2]	) == 3
      ):
            # Calculate the determinant of the matrix using Sarrus rule
            lowerCAmelCase    :		int				=      float(
                (
                    (d(matrix[0][0]	) * d(matrix[1][1]	) * d(matrix[2][2]	))
                    + (d(matrix[0][1]	) * d(matrix[1][2]	) * d(matrix[2][0]	))
                    + (d(matrix[0][2]	) * d(matrix[1][0]	) * d(matrix[2][1]	))
                )
                - (
                    (d(matrix[0][2]	) * d(matrix[1][1]	) * d(matrix[2][0]	))
                    + (d(matrix[0][1]	) * d(matrix[1][0]	) * d(matrix[2][2]	))
                    + (d(matrix[0][0]	) * d(matrix[1][2]	) * d(matrix[2][1]	))
                )	)
            if determinant == 0:
                  raise ValueError('''This matrix has no inverse.'''	)

            # Creating cofactor matrix
            lowerCAmelCase    :		Dict				=      [
                [d(0.0	), d(0.0	), d(0.0	)],
                [d(0.0	), d(0.0	), d(0.0	)],
                [d(0.0	), d(0.0	), d(0.0	)],
            ]
            lowerCAmelCase    :		List[str]				=      (d(matrix[1][1]	) * d(matrix[2][2]	)) - (
                d(matrix[1][2]	) * d(matrix[2][1]	)
            )
            lowerCAmelCase    :		Dict				=      -(
                (d(matrix[1][0]	) * d(matrix[2][2]	)) - (d(matrix[1][2]	) * d(matrix[2][0]	))
            )
            lowerCAmelCase    :		str				=      (d(matrix[1][0]	) * d(matrix[2][1]	)) - (
                d(matrix[1][1]	) * d(matrix[2][0]	)
            )
            lowerCAmelCase    :		Any				=      -(
                (d(matrix[0][1]	) * d(matrix[2][2]	)) - (d(matrix[0][2]	) * d(matrix[2][1]	))
            )
            lowerCAmelCase    :		Any				=      (d(matrix[0][0]	) * d(matrix[2][2]	)) - (
                d(matrix[0][2]	) * d(matrix[2][0]	)
            )
            lowerCAmelCase    :		Optional[int]				=      -(
                (d(matrix[0][0]	) * d(matrix[2][1]	)) - (d(matrix[0][1]	) * d(matrix[2][0]	))
            )
            lowerCAmelCase    :		Optional[int]				=      (d(matrix[0][1]	) * d(matrix[1][2]	)) - (
                d(matrix[0][2]	) * d(matrix[1][1]	)
            )
            lowerCAmelCase    :		Dict				=      -(
                (d(matrix[0][0]	) * d(matrix[1][2]	)) - (d(matrix[0][2]	) * d(matrix[1][0]	))
            )
            lowerCAmelCase    :		List[Any]				=      (d(matrix[0][0]	) * d(matrix[1][1]	)) - (
                d(matrix[0][1]	) * d(matrix[1][0]	)
            )

            # Transpose the cofactor matrix (Adjoint matrix)
            lowerCAmelCase    :		str				=      array(_snake_case	)
            for i in range(3	):
                  for j in range(3	):
                        lowerCAmelCase    :		Optional[Any]				=      cofactor_matrix[j][i]

        # Inverse of the matrix using the formula (1/determinant) * adjoint matrix
            lowerCAmelCase    :		Tuple				=      array(_snake_case	)
            for i in range(3	):
                  for j in range(3	):
                        inverse_matrix[i][j] /= d(_snake_case	)

        # Calculate the inverse of the matrix
            return [[float(d(_snake_case	)	) or 0.0 for n in row] for row in inverse_matrix]
      raise ValueError('''Please provide a matrix of size 2x2 or 3x3.'''	)


