


"""simple docstring"""







class 				__A    :






 """simple docstring"""




 def __init__(		self			,   __A						) ->					None:
     a					=len(__A						)
     a					=[0] * len_array

     if len_array > 0:
         a					=array[0]

     for i in range(1			,   __A						):
         a					=self.prefix_sum[i - 1] + array[i]


 def 				SCREAMING_SNAKE_CASE							(		self			,   __A			,   __A						) ->					int:
     if start == 0:
         return self.prefix_sum[end]

     return self.prefix_sum[end] - self.prefix_sum[start - 1]





 def 				SCREAMING_SNAKE_CASE							(		self			,   __A						) ->					bool:
     a					={0}
     for sum_item in self.prefix_sum:
         if sum_item - target_sum in sums:
             return True

         sums.add(__A						)

     return False


if __name__ == "__main__":
       import doctest

       doctest.testmod()



"""simple docstring"""







def _A						(						lowercase = 2_00_00_00		):







    """simple docstring"""
    a					=[0 for i in range(n + 1		)]
    a					=1
    a					=1

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


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