


'''simple docstring'''



def 			UpperCAmelCase__					(	UpperCAmelCase_    :				str							)     ->		str:
     __lowerCamelCase   :	str								=		len(UpperCAmelCase_							)
     while cur > 1:
          # Find the maximum number in arr
          __lowerCamelCase   :	Dict								=		arr.index(max(arr[0:cur]							)							)
          # Reverse from 0 to mi
          __lowerCamelCase   :	Any								=		arr[mi::-1] + arr[mi + 1 : len(UpperCAmelCase_							)]
          # Reverse whole list
          __lowerCamelCase   :	Dict								=		arr[cur - 1 :: -1] + arr[cur : len(UpperCAmelCase_							)]
          cur -= 1
     return arr


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










'''simple docstring'''



from math import isqrt



def 			UpperCAmelCase__					(	UpperCAmelCase_    :				int							)     ->		bool:
     return all(number % divisor != 0 for divisor in range(2      ,    isqrt(UpperCAmelCase_							) + 1							)							)



def 			UpperCAmelCase__					(	UpperCAmelCase_    :				int = 10**6							)     ->		int:
     __lowerCamelCase   :	Optional[Any]								=		0
     __lowerCamelCase   :	Optional[int]								=		1
     __lowerCamelCase   :	List[str]								=		7
     while prime_candidate < max_prime:
          primes_count += is_prime(UpperCAmelCase_							)

          cube_index += 1
          prime_candidate += 6 * cube_index

     return primes_count


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






