

import math





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





def  _snake_case		(snake_case_					:     int = 200_0000  )							->		int:
  return sum(num for num in range(3    ,       snake_case_    ,       2  ) if is_prime(snake_case_  )  ) + 2 if n > 2 else 0


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






'''simple docstring'''

def 				UpperCamelCase__      (      a__ = 1_0_0_0   ):


						'''simple docstring'''






						_lowerCAmelCase					    =[]
						_lowerCAmelCase					    =[]
						_lowerCAmelCase					    =3
						_lowerCAmelCase					    =5
						_lowerCAmelCase					    =1
						while True:
												_lowerCAmelCase					    =z * temp
												if result < n:
																		zmulti.append(a__   )
																		temp += 1
												else:
																		_lowerCAmelCase					    =1
																		break
						while True:
												_lowerCAmelCase					    =x * temp
												if result < n:
																		xmulti.append(a__   )
																		temp += 1
												else:
																		break
						_lowerCAmelCase					    =list(set(xmulti + zmulti   )   )
						return sum(a__   )


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





