from math import sqrt,floor
def is_prime(x):
    if x % 2 == 0 and x > 2: 
        return False
    return all(x % i for i in range(3, int(sqrt(x)) + 1, 2))
def smallestDivisor(z):
    squareRootOfn = floor(sqrt(z))
    for i in (3,squareRootOfn,2):
        if z % i == 0:
            return i 
def odd(p):
    return (p+1+p/smallestDivisor(p))
def even(q):
    temp=q
    s=0
    while temp%2==0:
        s+=temp 
        temp/=2
    if is_prime(temp):
        s+=temp+1
    else:
        s+=(temp+1+temp/smallestDivisor(temp))
    return s 
def longestSequence(a):
    total=0
    for i in a:
        if i==1:
            total+=1
        elif is_prime(i):
            total+=(i+1)
        elif i%2!=0:
            total+=odd(i)
        elif i%2==0:
            total+=even(i) 
            
    return int(total)
n=int(input().strip())
b=list(map(int,input().strip().split()))
print(longestSequence(b))