



'''simple docstring'''



def   __lowerCAmelCase					(							lowerCamelCase   :						list[int]					):






	'''simple docstring'''




	if not numbers:
		return 0

	if not isinstance(lowerCamelCase				,		(list, tuple)					) or not all(
	    isinstance(lowerCamelCase				,		lowerCamelCase					) for number in numbers					):
		raise ValueError("numbers must be an iterable of integers"					)

	__lowerCAmelCase												=  __lowerCAmelCase												=  __lowerCAmelCase												=  numbers[0]

	for i in range(1				,		len(lowerCamelCase					)					):
		# update the maximum and minimum subarray products
		__lowerCAmelCase												=  numbers[i]
		if number < 0:
			__lowerCAmelCase							,       __lowerCAmelCase												=  min_till_now, max_till_now
		__lowerCAmelCase												=  max(lowerCamelCase				,		max_till_now * number					)
		__lowerCAmelCase												=  min(lowerCamelCase				,		min_till_now * number					)

		# update the maximum product found till now
		__lowerCAmelCase												=  max(lowerCamelCase				,		lowerCamelCase					)

	return max_prod




'''simple docstring'''



def   __lowerCAmelCase					(							lowerCamelCase   :						Union[str, Any]					):






	'''simple docstring'''




	__lowerCAmelCase												=  1
	__lowerCAmelCase												=  2
	while i * i <= n:
		__lowerCAmelCase												=  0
		while n % i == 0:
			n //= i
			multiplicity += 1
		n_divisors *= multiplicity + 1
		i += 1
	if n > 1:
		n_divisors *= 2
	return n_divisors



def   __lowerCAmelCase					(							):






	'''simple docstring'''




	__lowerCAmelCase												=  1
	__lowerCAmelCase												=  1

	while True:
		i += 1
		t_num += i

		if count_divisors(lowerCamelCase					) > 5_00:
			break

	return t_num


if __name__ == "__main__":
	print(solution())