import math
def isprime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for i in range(3, int(math.sqrt(n)) + 1, 2):
        if n % i == 0: return False
    return True
n=int(input())
ans=0
for i in range(1,n+1):
    if isprime(i):
        ans+=i
print(ans)