def z(n):
    if n<2:
        return False
    for i in range(2,int(n**0.5)+1):
        if n%i==0:
            return False
    return True
A=[]
while True:
    q=int(input())
    if q==0:
        break
    A.append(q)
kq=0
for i in A:
    if z(i):
        kq+=i
print(kq)

total_prime_sum = 0
while True:
    n= int(input())
    if n==0:
        break
    if n>1:
        ok=True
        if n==2:
            ok=True
        elif n%2==0:
            ok=False
        else:
            for i in range(3, int(n**0.5)+1, 2):
                if n% i==0:
                    ok= False
                    break
        if ok:
            t+=n
print(t)