

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

def        lowerCamelCase__       (    _a):
	SCREAMING_SNAKE_CASE      :					List[str]    =				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()
"""simple docstring"""




def 							SCREAMING_SNAKE_CASE     (			_lowerCamelCase						:       int = 50	)       ->      int:
  _lowerCAmelCase						:       int  			=     [1] * (length + 1)

  for row_length in range(3			,length + 1	):
    for block_length in range(3			,row_length + 1	):
      for block_start in range(row_length - block_length	):
        ways_number[row_length] += ways_number[
            row_length - block_start - block_length - 1
        ]

      ways_number[row_length] += 1

  return ways_number[length]


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




