
from maths.prime_factors import prime_factors



def      __lowerCAmelCase						(							UpperCAmelCase__				:      int       )  ->    int:
							if not isinstance(UpperCAmelCase__			,				UpperCAmelCase__       ):
														lowerCamelCase_							  =					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()







def      __lowerCAmelCase						(							UpperCAmelCase__				:      int = 4_0_0_0_0_0_0       )  ->    int:
							lowerCamelCase_							  =					[]
							lowerCamelCase_  ,   lowerCamelCase_							  =					0, 1
							while b <= n:
														if b % 2 == 0:
																					even_fibs.append(UpperCAmelCase__       )
														lowerCamelCase_  ,   lowerCamelCase_							  =					b, a + b
							return sum(UpperCAmelCase__       )


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





