





def        __lowerCamelCase (							__a       :int = 1_0_0   )		->    int:






		"""simple docstring"""

		A__  				=       n * (n + 1) * (2 * n + 1) / 6
		A__  				=       (n * (n + 1) / 2) ** 2
		return int(square_of_sum - sum_of_squares   )


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








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







def        __lowerCamelCase (							__a       :int   )		->    int:






		"""simple docstring"""

		A__  				=       prime_factors(__a   )
		if is_square_free(__a   ):
				return -1 if len(__a   ) % 2 else 1
		return 0


if __name__ == "__main__":
					import doctest

					doctest.testmod()



