






from math import isqrt

def 	__lowerCamelCase      (		snake_case__		)							->  bool:






						"""simple docstring"""





						return all(number % divisor != 0 for divisor in range(2	,isqrt(snake_case__		) + 1		)		)

def 	__lowerCamelCase      (		snake_case__ = 10**6		)							->  int:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE     				=  0
						_SCREAMING_SNAKE_CASE     				=  1
						_SCREAMING_SNAKE_CASE     				=  7
						while prime_candidate < max_prime:
												primes_count += is_prime(snake_case__		)

												cube_index += 1
												prime_candidate += 6 * cube_index

						return primes_count


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









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

def 	__lowerCamelCase      (		snake_case__		)							->  int:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE     				=  prime_factors(snake_case__		)
						if is_square_free(snake_case__		):
												return -1 if len(snake_case__		) % 2 else 1
						return 0


if __name__ == "__main__":
		import doctest

		doctest.testmod()

