


'''simple docstring'''




def    UpperCAmelCase_  (       A      ):
   '''simple docstring'''





   def merge(A		,	A      ) -> list:

      def _merge():
         while left and right:
            yield (left if left[0] <= right[0] else right).pop(0      )
         yield from left
         yield from right

      return list(_merge()      )

   if len(A__      ) <= 1:
      return collection
   _a					:  List[str]						=  len(A__      ) // 2
   return merge(merge_sort(collection[:mid]      )		,	merge_sort(collection[mid:]      )      )


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 UpperCAmelCase_      :		List[Any]          =		input("Enter numbers separated by a comma:\n").strip()
 UpperCAmelCase_      :		Union[str, Any]          =		[int(item) for item in user_input.split(",")]
 print(*merge_sort(unsorted), sep=",")




'''simple docstring'''
from __future__ import annotations






def      UpperCamelCase_				(      A__						):
	a_      				=						[True] * limit
	a_      				=						False
	a_      				=						False
	a_      				=						True

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

	a_      				=						[2]

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

	return primes






def      UpperCamelCase_				(      A__ = 1_00_00_00						):
	a_      				=						prime_sieve(A__						)
	a_      				=						0
	a_      				=						0

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

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

	return largest


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