



def 		a__			(		_UpperCamelCase			: int = 2_00_00_00							):
   __lowerCamelCase													=    [0 for i in range(n + 1							)]
   __lowerCamelCase													=    1
   __lowerCamelCase													=    1

   for i in range(2 ,int(n**0.5							) + 1							):
      if primality_list[i] == 0:
         for j in range(i * i ,n + 1 ,_UpperCamelCase							):
            __lowerCamelCase													=    1
   __lowerCamelCase													=    0
   for i in range(_UpperCamelCase							):
      if primality_list[i] == 0:
         sum_of_primes += i
   return sum_of_primes


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









def 		a__			(		_UpperCamelCase			: str ,_UpperCamelCase			: str = " "							):
   __lowerCamelCase													=    []

   __lowerCamelCase													=    0
   for index, char in enumerate(_UpperCamelCase							):
      if char == separator:
         split_words.append(string[last_index:index]							)
         __lowerCamelCase													=    index + 1
      elif index + 1 == len(_UpperCamelCase							):
         split_words.append(string[last_index : index + 1]							)
   return split_words


if __name__ == "__main__":
  from doctest import testmod

  testmod()






