n = int(input().strip())
def is_prime(q):
    q = abs(q)
    if q == 2: return True
    if q < 2: return False
    return pow(2, q-1, q) == 1

sumNum = 0
for i in range(1, n+1):
    sumNum += is_prime(i)*i
print(sumNum)