

import math
from collections.abc import Iterator
from itertools import takewhile

def    A_  (							a  ):

      """simple docstring"""



      if 1 < number < 4:
            # 2 and 3 are primes
            return True
      elif number < 2 or number % 2 == 0 or number % 3 == 0:
            # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
            return False

      # All primes number are in format of 6k +/- 1
      for i in range(5					,   int(math.sqrt(a  ) + 1  )					,   6  ):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True

def    A_  (							):

      """simple docstring"""



      SCREAMING_SNAKE_CASE_				:  str           =     2
      while True:
            if is_prime(a  ):
                  yield num
            num += 1

def    A_  (							a = 2_0_0_0_0_0_0  ):

      """simple docstring"""



      return sum(takewhile(lambda a  : x < n					,   prime_generator()  )  )


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









def    A_  (							a					,   a  ):

      """simple docstring"""



      return numa ^ numa < 0


if __name__ == "__main__":
    import doctest

    doctest.testmod()






