r=[]
def isPrime(n):
flag=0
for i in range(2,n):
if n%i==0:
flag=1
if flag==0:
return n
else:
return 0
def f(n):
c=0
b=0
for i in range(2,n+1):
if isPrime(i)!=0:
r.append(i)
c+=i
b+=1
return c
p=int(input())
if p<100000000:
c=f(p)
if len(r)>10:
for i in range(0,len(r)-10):
c-=r[i]
print(c)
else:
print(999998912)