def findPrime(ele):
    counter = 0
    number = 2
    while number <= ele**0.5 and counter == 0:
        if ele%number == 0:
            counter = 1
        number += 1
    if counter == 1:
        return(number-1)
    else:
        return(ele)


def factor(ele):
    s1 = set()
    s2 = set()
    for number in range(2, int(ele**0.5)+1):
        if ele%number == 0:
            s1.add(int(ele/number)); s1.add(int(number))
    while s1:
        var = min(s1)
        s1 = set(filter(lambda x: x%var == 0, s1))
        s2.add(min(s1)); s1.remove(min(s1))
    return(s2)

def longestSequence(a):
    outsum = 0
    for number in a:
        if number != 1:
            summer = number + 1
            z = factor(number)
            for ele in z:
                summer += number/ele
            outsum += summer
        else:
            outsum += 1
    return(int(outsum))


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