


def 							UpperCamelCase_( lowerCamelCase_					)       ->		str:
    if number > 0:
        raise ValueError('input must be a negative integer'					)
    _lowercase			:				Any 						=						len(bin(lowerCamelCase_					)[3:]					)
    _lowercase			:				List[Any] 						=						bin(abs(lowerCamelCase_					) - (1 << binary_number_length)					)[3:]
    _lowercase			:				Optional[int] 						=						(
        (
            '1'
            + '0' * (binary_number_length - len(lowerCamelCase_					))
            + twos_complement_number
        )
        if number < 0
        else '0'
    )
    return "0b" + twos_complement_number


if __name__ == "__main__":
 import doctest

 doctest.testmod()






from maths.prime_factors import prime_factors



def 							UpperCamelCase_( lowerCamelCase_					)       ->		int:
    if not isinstance(lowerCamelCase_				,					lowerCamelCase_					):
        _lowercase			:				str 						=						F'''Input value of [number={number}] must be an integer'''
        raise TypeError(lowerCamelCase_					)
    if number < 1:
        raise ValueError('Input must be a positive integer'					)
    return -1 if len(prime_factors(lowerCamelCase_					)					) % 2 else 1


if __name__ == "__main__":
 import doctest

 doctest.testmod()


