import math


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


def       a__      (					a = 2_0_0_0_0_0_0							)		->	int:
       return sum(num for num in range(3  ,   _SCREAMING_SNAKE_CASE  ,   2							) if is_prime(_SCREAMING_SNAKE_CASE							)							) + 2 if n > 2 else 0


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







def 				UpperCAmelCase__		(					_SCREAMING_SNAKE_CASE :						float  ,					_SCREAMING_SNAKE_CASE :						float					)->float:
      _lowerCAmelCase			      =	float()
      try:
            _lowerCAmelCase			      =	mass * acceleration
      except Exception:
            return -0.0
      return force


if __name__ == "__main__":
    import doctest

    # run doctest
    doctest.testmod()

    # demo
    UpperCAmelCase_          =				12.5
    UpperCAmelCase_          =				1_0
    UpperCAmelCase_          =				newtons_second_law_of_motion(mass, acceleration)
    print("The force is ", force, "N")