



def 						UpperCamelCase      (  snake_case__			:       list      )      ->	list:







   for i in range(len(snake_case_      ) - 1			,	0			,	-1      ):
      UpperCamelCase       :    Union[str, Any]		      =      False

      for j in range(snake_case_			,	0			,	-1      ):
         if unsorted[j] < unsorted[j - 1]:
            UpperCamelCase       :    Union[str, Any]		      =      unsorted[j - 1], unsorted[j]
            UpperCamelCase       :    Optional[int]		      =      True

      for j in range(snake_case_      ):
         if unsorted[j] > unsorted[j + 1]:
            UpperCamelCase       :    Optional[Any]		      =      unsorted[j + 1], unsorted[j]
            UpperCamelCase       :    Union[str, Any]		      =      True

      if not swapped:
         break
   return unsorted


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    __UpperCAmelCase			  =			input('''Enter numbers separated by a comma:\n''').strip()
    __UpperCAmelCase			  =			[int(item) for item in user_input.split(''',''')]
    print(F"""{cocktail_shaker_sort(unsorted) = }""")










"""simple docstring"""



def 						__lowercase	(  snake_case_    :    int = 2000000		)  ->int:



    '''simple docstring'''







    __A       :		List[Any]							=	[0 for i in range(n + 1		)]
    __A       :		str							=	1
    __A       :		Dict							=	1

    for i in range(2							,int(n**0.5		) + 1		):
        if primality_list[i] == 0:
            for j in range(i * i							,n + 1							,snake_case_		):
                __A       :		List[Any]							=	1
    __A       :		Union[str, Any]							=	0
    for i in range(snake_case_		):
        if primality_list[i] == 0:
            sum_of_primes += i
    return sum_of_primes


if __name__ == "__main__":
       print(f'''{solution() = }''')




