



'''simple docstring'''



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






	'''simple docstring'''




	__lowerCAmelCase												=  (boundary[1] - boundary[0]) / steps
	__lowerCAmelCase												=  boundary[0]
	__lowerCAmelCase												=  boundary[1]
	__lowerCAmelCase												=  make_points(lowerCamelCase				,		lowerCamelCase				,		lowerCamelCase					)
	__lowerCAmelCase												=  0.0
	y += (h / 2.0) * f(lowerCamelCase					)
	for i in x_i:
		# print(i)
		y += h * f(lowerCamelCase					)
	y += (h / 2.0) * f(lowerCamelCase					)
	return y



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






	'''simple docstring'''




	__lowerCAmelCase												=  a + h
	while x < (b - h):
		yield x
		__lowerCAmelCase												=  x + h



def   __lowerCAmelCase					(							lowerCamelCase   :						int					):  # enter your function here






	'''simple docstring'''




	__lowerCAmelCase												=  (x - 0) * (x - 0)
	return y



def   __lowerCAmelCase					(							):






	'''simple docstring'''




	__lowerCAmelCase												=  0.0  # Lower bound of integration
	__lowerCAmelCase												=  1.0  # Upper bound of integration
	__lowerCAmelCase												=  10.0  # define number of steps or resolution
	__lowerCAmelCase												=  [a, b]  # define boundary of integration
	__lowerCAmelCase												=  method_a(lowerCamelCase				,		lowerCamelCase					)
	print(f'''y = {y}'''					)


if __name__ == "__main__":
	main()




'''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())