def longseq(left,right):
    if right-left<=1:
        return 1
    elif right-left>1:
        if(prime(right)):
            return right+1
        else:
            c=right
            i=2
            while(right//i!=1):
                if (right%i!=0):
                    i=i+1
                else:
                    c=c+right//i
                    right=right//i
            return c+1

def prime(n):
    if n>1:
        for i in range(2,n):
            if(n%i==0):
                return 0
        else:
            return 1
    else:
        return 1
    
t=int(input())
n=list(map(int,input().split()))
c=0
for i in range(len(n)):
    c=c+longseq(0,n[i])
print(c)