

from maths.prime_factors import prime_factors







def 							_lowerCamelCase   (			SCREAMING_SNAKE_CASE   ):
      '''simple docstring'''







      if not isinstance(SCREAMING_SNAKE_CASE		,				SCREAMING_SNAKE_CASE   ):
            A_							       =		f"Input value of [number={number}] must be an integer"
            raise TypeError(SCREAMING_SNAKE_CASE   )
      if number < 1:
            raise ValueError('''Input must be a positive integer'''   )
      return -1 if len(prime_factors(SCREAMING_SNAKE_CASE   )   ) % 2 else 1


if __name__ == "__main__":
      import doctest

      doctest.testmod()








def 							_lowerCamelCase   (			SCREAMING_SNAKE_CASE = 1000   ):
      '''simple docstring'''







      return sum(2 * a * ((a - 1) // 2) for a in range(3		,				n + 1   )   )


if __name__ == "__main__":
      print(solution())





