

def       __lowerCAmelCase      (						A    ):
	UpperCAmelCase_       				=			int(A    )
	if n_element < 1:
		UpperCAmelCase_       				=			ValueError("a should be a positive number"    )
		raise my_error

	UpperCAmelCase_       				=			[1]
	UpperCAmelCase_				,   UpperCAmelCase_				,   UpperCAmelCase_       				=			(0, 0, 0)
	UpperCAmelCase_       				=			1
	while index < n_element:
		while hamming_list[i] * 2 <= hamming_list[-1]:
			i += 1
		while hamming_list[j] * 3 <= hamming_list[-1]:
			j += 1
		while hamming_list[k] * 5 <= hamming_list[-1]:
			k += 1
		hamming_list.append(
		    min(hamming_list[i] * 2       ,     hamming_list[j] * 3       ,     hamming_list[k] * 5    )    )
		index += 1
	return hamming_list


if __name__ == "__main__":
				_a:    Any 							=			input("""Enter the last number (nth term) of the Hamming Number Series: """)
				print("""Formula of Hamming Number Series => 2^i * 3^j * 5^k""")
				_a:    str 							=			hamming(int(n))
				print("""-----------------------------------------------------""")
				print(F'The list with nth numbers is: {hamming_numbers}')
				print("""-----------------------------------------------------""")


from collections.abc import Sequence



def       __lowerCAmelCase      (						A       ,     A = False    ):
	if not arr:
		return 0

	UpperCAmelCase_       				=			0 if allow_empty_subarrays else float("-inf"    )
	UpperCAmelCase_       				=			0.0
	for num in arr:
		UpperCAmelCase_       				=			max(0 if allow_empty_subarrays else num       ,     curr_sum + num    )
		UpperCAmelCase_       				=			max(A       ,     A    )

	return max_sum


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

				testmod()

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