




from functools import lru_cache



def 							_A       (						lowerCAmelCase_					: int      ):
     """simple docstring"""

     lowerCAmelCase__          =			2
     lowerCAmelCase__          =			set()
     while i * i <= n:
          if n % i:
               i += 1
          else:
               n //= i
               factors.add(lowerCAmelCase_      )
     if n > 1:
          factors.add(lowerCAmelCase_      )
     return factors



@lru_cache
def 							_A       (						lowerCAmelCase_					: int      ):
     """simple docstring"""

     return len(unique_prime_factors(lowerCAmelCase_      )      )



def 							_A       (						lowerCAmelCase_					: list      ):
     """simple docstring"""

     return len(set(lowerCAmelCase_      )      ) in (0, 1)



def 							_A       (						lowerCAmelCase_					: int      ):
     """simple docstring"""

     lowerCAmelCase__          =			2

     while True:
          # Increment each value of a generated range
          lowerCAmelCase__          =			[base + i for i in range(lowerCAmelCase_      )]

          # Run elements through out unique_prime_factors function
          # Append our target number to the end.
          lowerCAmelCase__          =			[upf_len(lowerCAmelCase_      ) for x in group]
          checker.append(lowerCAmelCase_      )

          # If all numbers in the list are equal, return the group variable.
          if equality(lowerCAmelCase_      ):
               return group

          # Increment our base variable by 1
          base += 1



def 							_A       (						lowerCAmelCase_					: int = 4      ):
     """simple docstring"""

     lowerCAmelCase__          =			run(lowerCAmelCase_      )
     return results[0] if len(lowerCAmelCase_      ) else None


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






from maths.prime_factors import prime_factors



def 							_A       (						lowerCAmelCase_					: int      ):
     """simple docstring"""

     if not isinstance(lowerCAmelCase_       ,    lowerCAmelCase_      ):
          lowerCAmelCase__          =			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()
