


def 					lowerCamelCase_   (	_a	):




		"""simple docstring"""






		stooge(_a     ,       0     ,       len(_a	) - 1	)
		return arr






def 					lowerCamelCase_   (	_a     ,       _a     ,       _a	):




		"""simple docstring"""






		if i >= h:
				return

		# If first element is smaller than the last then swap them
		if arr[i] > arr[h]:
				lowerCAmelCase__					,     lowerCAmelCase__       :      List[Any]   					= arr[h], arr[i]

		# If there are more than 2 elements in the array
		if h - i + 1 > 2:
				lowerCAmelCase__       :      Tuple   					= (int)((h - i + 1) / 3	)

				# Recursively sort first 2/3 elements
				stooge(_a     ,       _a     ,       (h - t)	)

				# Recursively sort last 2/3 elements
				stooge(_a     ,       i + t     ,       (_a)	)

				# Recursively sort first 2/3 elements
				stooge(_a     ,       _a     ,       (h - t)	)


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








from math import isqrt






def 					lowerCamelCase_   (	_a	):




		"""simple docstring"""






		lowerCAmelCase__       :      Dict   					= [True] * max_number
		for i in range(2     ,       isqrt(max_number - 1	) + 1	):
				if is_prime[i]:
						for j in range(i**2     ,       _a     ,       _a	):
								lowerCAmelCase__       :      int   					= False

		return [i for i in range(2     ,       _a	) if is_prime[i]]






def 					lowerCamelCase_   (	_a = 10**8	):




		"""simple docstring"""






		lowerCAmelCase__       :      Any   					= calculate_prime_numbers(max_number // 2	)

		lowerCAmelCase__       :      Tuple   					= 0
		lowerCAmelCase__       :      List[Any]   					= 0
		lowerCAmelCase__       :      Optional[int]   					= len(_a	) - 1
		while left <= right:
				while prime_numbers[left] * prime_numbers[right] >= max_number:
						right -= 1
				semiprimes_count += right - left + 1
				left += 1

		return semiprimes_count


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




