






from collections.abc import Sequence

def      lowerCAmelCase__	(    _a       :			Sequence[float]  ,      _a       :			bool = False    ):
		if not arr:
				return 0

		snake_case_				:							Tuple						 =       0 if allow_empty_subarrays else float("-inf"    )
		snake_case_				:							List[Any]						 =       0.0
		for num in arr:
				snake_case_				:							Dict						 =       max(0 if allow_empty_subarrays else num  ,      curr_sum + num    )
				snake_case_				:							Any						 =       max(_a  ,      _a    )

		return max_sum


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

							testmod()

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








import math

def      lowerCAmelCase__	(    _a       :			int    ):

		if 1 < number < 4:
				# 2 and 3 are primes
				return True
		elif number < 2 or number % 2 == 0 or number % 3 == 0:
				# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
				return False

		# All primes number are in format of 6k +/- 1
		for i in range(5  ,      int(math.sqrt(_a    ) + 1    )  ,      6    ):
				if number % i == 0 or number % (i + 2) == 0:
						return False
		return True

def      lowerCAmelCase__	(    _a       :			float = 0.1    ):
		snake_case_				:							int						 =       3
		snake_case_				:							Optional[Any]						 =       3

		while primes / (2 * j - 1) >= ratio:
				for i in range(j * j + j + 1  ,      (j + 2) * (j + 2)  ,      j + 1    ):
						primes += is_prime(_a    )
				j += 2
		return j


if __name__ == "__main__":
							import doctest

							doctest.testmod()
