text: # The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
  
  # Find the sum of all the primes below two million.
  
  answer = 0
  
  
  def isPrime(n: int):
      if not isinstance(n, int):
          return False
      if n <= 1:
          return False
      elif n <= 3:
          return True
      elif n % 2 == 0 or n % 3 == 0:
          return False
      j = 5
      while j * j <= n:
          if n % j == 0 or n % (j + 2) == 0:
              return False
          j += 6
      return True
  
  
  for i in range(1, 2000000):
      if isPrime(i):
          answer += i
  
  
  print(answer)
  