#!/bin/python3

import sys
d = {}
def calvalue(i):
    global d
    x = int(i**0.5 + 0.5)
    m = 0
    f = 0
    for j in range(2,x+1):
        if(i%j == 0):
            f = 1
            if j not in d:
                calvalue(j)
            if i//j not in d:
                calvalue(i//j)
            
            t1 = d[j]*(i//j)+1
            t2 = d[(i//j)]*j +1
            if t1 > m:
                m = t1
            if t2 > m:
                m = t2
    if(f == 0):
        d[i] = i+1
    else:
        d[i] = m
        
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    global d    
    s = 0
        
    for i in range(0,len(a)):
        if a[i] not in d:
            calvalue(a[i]);
        s += d[a[i]]
    return s

if __name__ == "__main__":
    d[1] = 1;
    d[2] = 3;
    d[3] = 4;
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)