import math

values = {}
values[1] = 1
values[2]=3
def findLongest(n):
    global values
    if n in values:
        return values[n]
    limit=math.sqrt(n) + 1
    i = 2
    while i <= limit:
        if (n % i == 0):
            if (n // i == i):
                answer=n+findLongest(i)
                values[n]=answer
                return answer
            else:
                answer=n+max(findLongest(i),findLongest(n//i))
                values[n]=answer
                return answer
        i = i + 1
    answer=values[n]=n+1
    return answer

def longestSequence(a):
    a.sort()
    answer=0
    for number in a:
        answer+=findLongest(number)
    return answer


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