
"""simple docstring"""





def 						_lowerCAmelCase				(				UpperCamelCase_ = 50				):
		__SCREAMING_SNAKE_CASE            = [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() = }""")









'''simple docstring'''





from maths.prime_factors import prime_factors
def    _SCREAMING_SNAKE_CASE  (       UpperCamelCase			):



    """simple docstring"""





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


if __name__ == "__main__":
 import doctest

 doctest.testmod()


