





from math import isqrt





def   lowerCamelCase__       (       UpperCamelCase__     :    int  )     ->	bool:



					'''simple docstring'''




					return all(number % divisor != 0 for divisor in range(2    ,      isqrt(UpperCamelCase__  ) + 1  )  )





def   lowerCamelCase__       (       UpperCamelCase__     :    int = 10**6  )     ->	int:



					'''simple docstring'''




					_snake_case													=			0
					_snake_case													=			1
					_snake_case													=			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() = }")










from collections.abc import Sequence





def   lowerCamelCase__       (       UpperCamelCase__     :    Sequence[float]    ,      UpperCamelCase__     :    bool = False  )     ->	float:



					'''simple docstring'''




					if not arr:
										return 0

					_snake_case													=			0 if allow_empty_subarrays else float('-inf'  )
					_snake_case													=			0.0
					for num in arr:
										_snake_case													=			max(0 if allow_empty_subarrays else num    ,      curr_sum + num  )
										_snake_case													=			max(UpperCamelCase__    ,      UpperCamelCase__  )

					return max_sum


if __name__ == "__main__":
					from doctest import testmod

					testmod()

					UpperCAmelCase_ 							=       [-2, 1, -3, 4, -1, 2, 1, -5, 4]
					print(F"{max_subarray_sum(nums) = }")



