def factors(n):
    gaps = [1,2,2,4,2,4,2,4,6,2,6]
    length, cycle = 11, 3
    f, fs, next = 2, [], 0
    while f * f <= n:
        while n % f == 0:
            fs.append(int(f))
            n /= f
        f += gaps[next]
        next += 1
        if next == length:
            next = cycle
    if n > 1: fs.append(int(n))
    return fs


def longSequence(num):

    nlist = factors(num)
    nlist.reverse()

    level = 1
    sum = 1
    for i in nlist:
        level = level * i
        sum += level
    return sum

def longestSequence(a):
    count = 0
    for i in a:
        count += longSequence(i)
    return count


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