

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() = }''')








def   UpperCamelCase(   lowercase_     ,   lowercase_				)      ->							Union[str, Any]:





  '''simple docstring'''





  if len(str(lowercase_				)				) == 1 or len(str(lowercase_				)				) == 1:
    return a * b

  snake_case_					= max(len(str(lowercase_				)				)     ,   len(str(lowercase_				)				)				)
  snake_case_					= ma // 2

  snake_case_		,							snake_case_					= divmod(lowercase_     ,   10**ma				)
  snake_case_		,							snake_case_					= divmod(lowercase_     ,   10**ma				)

  snake_case_					= karatsuba(lowercase_     ,   lowercase_				)
  snake_case_					= karatsuba((aa + aa)     ,   (ba + ba)				)
  snake_case_					= karatsuba(lowercase_     ,   lowercase_				)

  return (z * 10 ** (2 * ma)) + ((y - z - x) * 10 ** (ma)) + (x)



def   UpperCamelCase(   )      ->							Dict:





  '''simple docstring'''





  print(karatsuba(15463     ,   23489				)				)


if __name__ == "__main__":
    main()