

import math


def 			__UpperCamelCase    (lowerCAmelCase					:  int     )     ->  bool:

      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(lowerCAmelCase     ) + 1     ),    6     ):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True


def 			__UpperCamelCase    (lowerCAmelCase					:  int = 2_000_000     )     ->  int:
      return sum(num for num in range(3,    lowerCAmelCase,    2     ) if is_prime(lowerCAmelCase     )     ) + 2 if n > 2 else 0


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






from ..utils import requires_backends


_UpperCAmelCase    	=			None



class        _UpperCAmelCase :
  '''simple docstring'''







  def __init__( self	: List[str]		,						*UpperCamelCase__	: str		,						**UpperCamelCase__	: Any ):
        requires_backends(self		,						['detectron2'] )







  @classmethod
  def 	UpperCamelCase       ( cls	: Dict		,						*UpperCamelCase__	: Tuple		,						**UpperCamelCase__	: List[Any] ):
        requires_backends(cls		,						['detectron2'] )



