



'''simple docstring'''


import math
from collections.abc import Iterator
from itertools import takewhile






def  UpperCAmelCase_       (		lowercase__       ):


					'''simple docstring'''







					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  UpperCAmelCase_       (		):


					'''simple docstring'''







					a_       		=2
					while True:
										if is_prime(__snake_case       ):
															yield num
										num += 1






def  UpperCAmelCase_       (		lowercase__ = 2_0_0_0_0_0_0       ):


					'''simple docstring'''







					return sum(takewhile(lambda lowercase__       : x < n       ,	prime_generator()       )       )


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







'''simple docstring'''


from collections.abc import Sequence






def  UpperCAmelCase_       (		lowercase__ = None       ):


     '''simple docstring'''







     if nums is None or not nums:
          raise ValueError("Input sequence should not be empty"       )

     a_       		=nums[0]
     for i in range(1       ,	len(lowercase__       )       ):
          a_       		=nums[i]
          a_       		=max(lowercase__       ,	ans + num       ,	lowercase__       )

     return ans


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  # Try on a sample input from the user
  lowercase							       =			int(input('''Enter number of elements : ''').strip())
  lowercase							       =			list(map(int, input('''\nEnter the numbers : ''').strip().split()))[:n]
  print(max_subsequence_sum(array))


