





from collections.abc import Callable

import numpy as np





def    __UpperCamelCase      (    a,     a,     a,     a,     a) ->np.ndarray:
					lowerCamelCase__       =       int(np.ceil((x_end - xa) / step_size))
					lowerCamelCase__       =       np.zeros((n + 1,))
					lowerCamelCase__       =       ya
					lowerCamelCase__       =       xa

					for k in range(a):
										lowerCamelCase__       =       y[k] + step_size * ode_func(a,     y[k])
										x += step_size

					return y


if __name__ == "__main__":
						import doctest

						doctest.testmod()








def    __UpperCamelCase      (    a = 100) ->int:
					lowerCamelCase__       =       (n * (n + 1) // 2) ** 2
					lowerCamelCase__       =       n * (n + 1) * (2 * n + 1) // 6
					return sum_cubes - sum_squares


if __name__ == "__main__":
						print(f"""{solution() = }""")

