






"""simple docstring"""




from math import isqrt

def      lowerCAmelCase__	(	UpperCamelCase__							):



  '''simple docstring'''
  _a    :			List[str]			 =      [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							):
        _a    :			List[Any]			 =      False

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

def      lowerCAmelCase__	(	UpperCamelCase__ = 1_0**8							):



  '''simple docstring'''
  _a    :			str			 =      calculate_prime_numbers(max_number // 2							)

  _a    :			int			 =      0
  _a    :			Union[str, Any]			 =      0
  _a    :			List[Any]			 =      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() = }''')








def   __lowerCamelCase   (				__a  :Optional[Any]       )						->							Tuple:






		"""simple docstring"""

		A__     =  len(__a       )
		while cur > 1:
				# Find the maximum number in arr
				A__     =  arr.index(max(arr[0:cur]       )       )
				# Reverse from 0 to mi
				A__     =  arr[mi::-1] + arr[mi + 1 : len(__a       )]
				# Reverse whole list
				A__     =  arr[cur - 1 :: -1] + arr[cur : len(__a       )]
				cur -= 1
		return arr


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



