




"""simple docstring"""
from __future__ import annotations





def 						UpperCAmelCase				(			A__:    int     )  ->     list[int]:
			__lowerCamelCase					:	Tuple	       =				[True] * limit
			__lowerCamelCase					:	str	       =				False
			__lowerCamelCase					:	Optional[Any]	       =				False
			__lowerCamelCase					:	List[str]	       =				True

			for i in range(3							,				int(limit**0.5 + 1     )							,				2     ):
						__lowerCamelCase					:	Any	       =				i * 2
						while index < limit:
									__lowerCamelCase					:	Tuple	       =				False
									__lowerCamelCase					:	List[Any]	       =				index + i

			__lowerCamelCase					:	Tuple	       =				[2]

			for i in range(3							,				A__							,				2     ):
						if is_prime[i]:
									primes.append(A__     )

			return primes





def 						UpperCAmelCase				(			A__:    int = 1000000     )  ->     int:
			__lowerCamelCase					:	str	       =				prime_sieve(A__     )
			__lowerCamelCase					:	int	       =				0
			__lowerCamelCase					:	str	       =				0

			for i in range(len(A__     )     ):
						for j in range(i + length							,				len(A__     )     ):
									__lowerCamelCase					:	Optional[int]	       =				sum(primes[i:j]     )
									if sol >= ceiling:
												break

									if sol in primes:
												__lowerCamelCase					:	List[str]	       =				j - i
												__lowerCamelCase					:	Tuple	       =				sol

			return largest


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









"""simple docstring"""
def 						UpperCAmelCase				(			A__:    Dict     )  ->     Optional[int]:
			stooge(A__							,				0							,				len(A__     ) - 1     )
			return arr





def 						UpperCAmelCase				(			A__:    Dict							,				A__:    List[str]							,				A__:    Optional[int]     )  ->     Any:
			if i >= h:
						return

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

			# If there are more than 2 elements in the array
			if h - i + 1 > 2:
						__lowerCamelCase					:	str	       =				(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__":
					a_				:    Tuple										=     input('''Enter numbers separated by a comma:\n''').strip()
					a_				:    Optional[Any]										=     [int(item) for item in user_input.split(''',''')]
					print(stooge_sort(unsorted))



