def longestSequence(a):
    total=0
    while(a>0):
        if(isprime(a)):
            total+=a+1
            break
        elif(a%2==0):
            total+=a
            a=a//2
        else:
            total+=a
            if(a==1):
                a=a-1;
            else:
                a=a//leastdivisor(a)
    return total

def isprime(n):
    k=int(n**0.5)
    for i in range(2,k+1):
        if(n%i==0):
            return False
    return True
def leastdivisor(n):
    for i in range (1,n,2):
        if(n%i==0):
            return i
    return 1;

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result=0;
    for i in range(n):
        result+=longestSequence(a[i])
    print(result)