


import math
def   _UpperCamelCase				(						lowerCAmelCase_   )						->bool:
   return math.sqrt(lowerCAmelCase_   ) * math.sqrt(lowerCAmelCase_   ) == num
def   _UpperCamelCase				(						lowerCAmelCase_   )						->bool:
   UpperCAmelCase							=     0
   UpperCAmelCase							=     n
   while left <= right:
      UpperCAmelCase							=     (left + right) // 2
      if mid**2 == n:
         return True
      elif mid**2 > n:
         UpperCAmelCase							=     mid - 1
      else:
         UpperCAmelCase							=     mid + 1
   return False


if __name__ == "__main__":
 import doctest

 doctest.testmod()







from math import isqrt
def   _UpperCamelCase				(						lowerCAmelCase_   )						->bool:
   return all(number % divisor != 0 for divisor in range(2  ,						isqrt(lowerCAmelCase_   ) + 1   )   )
def   _UpperCamelCase				(						lowerCAmelCase_ = 1_0**6   )						->int:
   UpperCAmelCase							=     0
   UpperCAmelCase							=     1
   UpperCAmelCase							=     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() = }""")



