


"""simple docstring"""



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






def       lowerCamelCase					(a_						:int)     ->							int:
       lowercase		:Optional[int]       							=				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"""



UpperCAmelCase      		=			{str(digit): digit**5 for digit in range(10)}






def       lowerCamelCase					(a_						:int)     ->							int:
       return sum(DIGITS_FIFTH_POWER[digit] for digit in str(a_))






def       lowerCamelCase					()     ->							int:
       return sum(
           number
           for number in range(1000				,				100_0000)
           if number == digits_fifth_powers_sum(a_))


if __name__ == "__main__":
 print(solution())

