from common import sieve

limit = 1000000

prime_set = sieve(limit).primes()
prime_list = list(prime_set)
prime_list.sort()

n = len(prime_list)

max_sum = 0
max_count = 0

for i in xrange(n):
	sum = prime_list[i]
	count = 1
	for j in xrange(i+1, n):
		sum += prime_list[j]
		count += 1
		if sum > prime_list[-1]:
			break

		if sum in prime_set and count > max_count:
			max_sum = sum
			max_count = count

print max_sum