
def 		UpperCamelCase						(   lowercase_ )		->						list:


  '''simple docstring'''






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

    for j in range(lowercase_			,			0			,			-1 ):
      if unsorted[j] < unsorted[j - 1]:
        lowercase__		,     lowercase__	: Tuple     		=   unsorted[j - 1], unsorted[j]
        lowercase__	: str     		=   True

    for j in range(lowercase_ ):
      if unsorted[j] > unsorted[j + 1]:
        lowercase__		,     lowercase__	: List[Any]     		=   unsorted[j + 1], unsorted[j]
        lowercase__	: Dict     		=   True

    if not swapped:
      break
  return unsorted


if __name__ == "__main__":
     import doctest

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








"""simple docstring"""



from itertools import permutations
def 					lowerCamelCase   (     _snake_case ):
    if num[3] % 2 != 0:
        return False

    if (num[2] + num[3] + num[4]) % 3 != 0:
        return False

    if num[5] % 5 != 0:
        return False

    UpperCAmelCase__	:      List[str]     							=					[7, 11, 13, 17]
    for i, test in enumerate(_snake_case ):
        if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
            return False
    return True
def 					lowerCamelCase   (     _snake_case = 10 ):
    return sum(
        int(''.join(map(_snake_case    ,_snake_case ) ) )
        for num in permutations(range(_snake_case ) )
        if is_substring_divisible(_snake_case ) )


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

