'''simple docstring'''

def __a (	__lowerCamelCase			:						Any				)	->							List[Any]:
      '''simple docstring'''


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


def __a (	__lowerCamelCase			:						Union[str, Any] ,		__lowerCamelCase			:						str ,		__lowerCamelCase			:						Union[str, Any]				)	->							Any:
      '''simple docstring'''


      if i >= h:
            return

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

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

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

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

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


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







'''simple docstring'''

from __future__ import annotations


def __a (	__lowerCamelCase			:						int				)	->							list[int]:
      '''simple docstring'''


      lowercase_     =      [True] * limit
      lowercase_     =      False
      lowercase_     =      False
      lowercase_     =      True

      for i in range(3 ,		int(limit**0.5 + 1				) ,		2				):
            lowercase_     =      i * 2
            while index < limit:
                  lowercase_     =      False
                  lowercase_     =      index + i

      lowercase_     =      [2]

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

      return primes


def __a (	__lowerCamelCase			:						int = 1_000_000				)	->							int:
      '''simple docstring'''


      lowercase_     =      prime_sieve(__lowerCamelCase				)
      lowercase_     =      0
      lowercase_     =      0

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

                  if sol in primes:
                        lowercase_     =      j - i
                        lowercase_     =      sol

      return largest


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






