

"""simple docstring"""





def     __SCREAMING_SNAKE_CASE    ( A_ = 2_00_00_00					):
	lowerCAmelCase__      :		List[str]    							=      [0 for i in range(n + 1					)]
	lowerCAmelCase__      :		List[Any]    							=      1
	lowerCAmelCase__      :		Optional[int]    							=      1

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


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







"""simple docstring"""





def     __SCREAMING_SNAKE_CASE    ( A_					):
	for i in range(len(A_					) - 1		,	0		,	-1					):
		lowerCAmelCase__      :		Optional[Any]    							=      False

		for j in range(A_		,	0		,	-1					):
			if unsorted[j] < unsorted[j - 1]:
				lowerCAmelCase__							,lowerCAmelCase__      :		Union[str, Any]    							=      unsorted[j - 1], unsorted[j]
				lowerCAmelCase__      :		Dict    							=      True

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

		if not swapped:
			break
	return unsorted


if __name__ == "__main__":
							import doctest

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




