
def  __magic_name__ (   __lowerCAmelCase	:						int = 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() = }')





from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors




def  __magic_name__ (   __lowerCAmelCase	:						int							)			->   int:
				__lowerCamelCase    					=	prime_factors(__lowerCAmelCase							)
				if is_square_free(__lowerCAmelCase							):
								return -1 if len(__lowerCAmelCase							) % 2 else 1
				return 0


if __name__ == "__main__":
					import doctest

					doctest.testmod()



