from math import isqrt






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






def  snake_case  (       snake_case__			:int = 10**6)						->   int:
       _A        =  0
       _A        =  1
       _A        =  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 math import isqrt






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






def  snake_case  (       snake_case__			:int = 10**6)						->   int:
       _A        =  0
       _A        =  1
       _A        =  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() = }''')




