





from __future__ import annotations





def   lowerCamelCase__       (       UpperCamelCase__     :    int  )     ->	list[int]:



					'''simple docstring'''




					_snake_case													=			2
					_snake_case													=			[]
					while i * i <= n:
										if n % i:
															i += 1
										else:
															n //= i
															factors.append(UpperCamelCase__  )
					if n > 1:
										factors.append(UpperCamelCase__  )
					return factors


if __name__ == "__main__":
					import doctest

					doctest.testmod()










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) = }")



