




def 						lowerCamelCase__    (		_A							):







	'''simple docstring'''





	snake_case_		    =     len(_A							)
	for i in range(_A							):
		for j in range(i + 1     ,	_A							):
			if numbers[j] < numbers[i]:
				snake_case_    ,      snake_case_		    =     numbers[j], numbers[i]
	return numbers


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






def 						lowerCamelCase__    (		_A							):







	'''simple docstring'''





	if num <= 0:
		raise ValueError("Input must be a positive integer"							)

	snake_case_		    =     [True] * (num + 1)

	snake_case_		    =     2
	while p * p <= num:
		if primes[p]:
			for i in range(p * p     ,	num + 1     ,	_A							):
				snake_case_		    =     False
		p += 1

	return [prime for prime in range(2     ,	num + 1							) if primes[prime]]


if __name__ == "__main__":
		import doctest

		doctest.testmod()

		lowercase__				:     Tuple 		=						int(input("Enter a positive integer: ").strip())
		print(prime_sieve_eratosthenes(user_num))
