import sys

def f(x,dp):
    if x==1:
        return 1
    r=0
    if dp[x]!=-1:
        return dp[x]

    for i in range(1,x):
        if x%i==0:
            r=max(r,1+(x//i)*f(i,dp))
    dp[x]=r
    return r

def longestSequence(a):
    ans=0
    m = max(a)
    dp = [-1 for i in range(m+1)]
    for i in range(len(a)):
        ans+=f(a[i],dp)

    return ans

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