import sys

def longestSequence(a):
    add=0
    for i in a:
        c=i
        f=0
        while i%2==0:
            c+=i/2
            if i/2==1:
                f=1
            i=i/2   
        for j in range(3,int(pow(i,1/2))+1,2):
            while i%j==0:
                c+=i/j
                if i/j==1:
                    f=1
                i=i/j
        if f==0:
            c+=1
        if c==2:
            c=1
        add+=c
    return add

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(int(result))