



def 	_lowerCAmelCase (    A__						):
      if len(A__						) <= 1:
            return lst

      lowercase__  =	1

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

      return lst


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





a__   :					Tuple 						=      "Tobias Carryer"

from time import time



class    UpperCAmelCase__:

   '''simple docstring'''




   def __init__(    self	:      str      ,					lowerCAmelCase	:      List[str]      ,					lowerCAmelCase	:      Any      ,					lowerCAmelCase	:      str      ,					lowerCAmelCase	:      str=int(time()))						->					List[Any]:  # noqa: B008




         """simple docstring"""

         lowercase__  =	multiplier
         lowercase__  =	increment
         lowercase__  =	modulo
         lowercase__  =	seed



   def       UpperCAmelCase		(    self	:      int)						->					Tuple:




         """simple docstring"""

         lowercase__  =	(self.multiplier * self.seed + self.increment) % self.modulo
         return self.seed


if __name__ == "__main__":
       # Show the LCG in action.
       a__   :					str 						=      LinearCongruentialGenerator(1_66_45_25, 10_13_90_42_23, 2 << 31)
       while True:
              print(lcg.next_number())
