def divide(x):
    sum=1
    if(x==1):
        return 1
    while x%2==0:
        sum=sum*2+1
        x=x/2
    i=3
    while i<=x**0.5:
        while x%i==0:
            sum=sum*i+1
            x=x/i
        i+=2
    if x!=1:               #remaining x is also prime
       sum=sum*x+1        
    return sum            

#
#def find_prime(m):
#    i=2
#    while i<=m:            #I have done it m and not m/2 because if m is prime then it must e known
#       p=2
#       flag=1
#       p=i**0.5
#       for j in range(len(p_arr)):
#           if(p_arr[j]>p):
#               break
#           if i%p_arr[j]==0:
#               flag=0
#               break
#             
#       if flag==1:
#           p_arr.append(i)
#       i+=1       
#           
#
#def divide(x):
#    sum=1
#    for ele in p_arr:
#        while x%ele==0:
#           sum=sum*ele+1
#           x=x/ele
#        if(ele>x):
#            break
#    return sum    
#    
#    
n=int(input())
arr=list(map(int,input().split()))
#p_arr=[]
##find_prime(max(arr))
#p_arr=[]
#find_prime(104)
##print(p_arr)
##print(divide(100000000000000))
#arr=[]
#for i in range(1,101):
#    arr.append(int(divide(i)))
#print(arr)    
ans=0
for ele in arr:
    ans+=divide(ele)
print(int(ans))