




from math import isqrt


def 					_a							(					lowerCAmelCase )->	bool:
		return all(number % divisor != 0 for divisor in range(2    ,						isqrt(lowerCAmelCase ) + 1 ) )


def 					_a							(					lowerCAmelCase = 10**6 )->	int:
		SCREAMING_SNAKE_CASE_					      =							0
		SCREAMING_SNAKE_CASE_					      =							1
		SCREAMING_SNAKE_CASE_					      =							7
		while prime_candidate < max_prime:
				primes_count += is_prime(lowerCAmelCase )

				cube_index += 1
				prime_candidate += 6 * cube_index

		return primes_count


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





from math import isqrt


def 					_a							(					lowerCAmelCase )->	bool:
		return all(number % divisor != 0 for divisor in range(2    ,						isqrt(lowerCAmelCase ) + 1 ) )


def 					_a							(					lowerCAmelCase = 10**6 )->	int:
		SCREAMING_SNAKE_CASE_					      =							0
		SCREAMING_SNAKE_CASE_					      =							1
		SCREAMING_SNAKE_CASE_					      =							7
		while prime_candidate < max_prime:
				primes_count += is_prime(lowerCAmelCase )

				cube_index += 1
				prime_candidate += 6 * cube_index

		return primes_count


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