def  _lowerCamelCase					(   a_				: str):
			lowerCamelCase						:Union[str, Any]						  =     0
			for ch in input_str:
						lowerCamelCase						:Optional[Any]						  =     ord(a_)
						lowerCamelCase						:List[Any]						  =     pow(2						,			a_)

						# If we already turned on bit for current character's unicode
						if bitmap >> ch_unicode & 1 == 1:
									return False
						bitmap |= ch_bit_index_on
			return True


if __name__ == "__main__":
			import doctest

			doctest.testmod()




from maths.prime_factors import prime_factors





def  _lowerCamelCase					(   a_				: int):
			if not isinstance(a_						,			a_):
						lowerCamelCase						:Tuple						  =     F"Input value of [number={number}] must be an integer"
						raise TypeError(a_)
			if number < 1:
						raise ValueError('''Input must be a positive integer''')
			return -1 if len(prime_factors(a_)) % 2 else 1


if __name__ == "__main__":
			import doctest

			doctest.testmod()



