def  _lowerCamelCase					(   a_				: int = 1_00):
			lowerCamelCase						:str						  =     0
			lowerCamelCase						:Optional[int]						  =     0
			for i in range(1						,			n + 1):
						sum_of_squares += i**2
						sum_of_ints += i
			return sum_of_ints**2 - sum_of_squares


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




from maths.prime_factors import prime_factors





def  _lowerCamelCase					(   a_				: int):
			if not isinstance(a_						,			a_):
						lowerCamelCase						:Tuple						  =     F"Input value of [number={number}] must be an integer"
						raise TypeError(a_)
			if number < 1:
						raise ValueError('''Input must be a positive integer''')
			return -1 if len(prime_factors(a_)) % 2 else 1


if __name__ == "__main__":
			import doctest

			doctest.testmod()



