n = int(input())
all_input = list(map(int , input().split()))
ans = 0
for test_case in range(n):
    a = all_input[test_case]
    divisor = list()
    cur = 1
    while(cur*cur <= a):
        if(a%cur == 0):
            divisor.append(cur)
            if(cur != a/cur):
                divisor.append(int(a/cur))
        cur = cur + 1
    divisor = sorted(divisor)
    f = list()
    L = len(divisor)
    for i in range(L):
        f.append(1)
    for i in range(1, L):
        for j in range(i):
            if(divisor[i] % divisor[j] == 0):
                f[i] = max(f[i] , 1 + divisor[i]/divisor[j]*f[j])
    ans += int(f[L - 1])
print(ans)