# sum of the primes less than n

def sumPrimes(n):
    sum, sieve = 0, [True] * (n+1)
    for p in range(2, n):
        if sieve[p]:
            sum += p
            for i in range(p*p, n, p):
                sieve[i] = False
    return sum

print sumPrimes(2000000)