import math
import sys
dict= {}
def factors(n):
    list = []
    for i in range(int(n**0.5)+1):
        if(i > 1 and n%i==0):
            list.append(i)
            list.append(n/i)
            if(i**2 ==n):
                list.pop(len(list)-1)
    list.append(n)
    return sorted(list)

def moves(n):
    if(n==1):
        return 1
    if(n in dict):
        return dict[n]
    maxval = 0
    for i in factors(n):
        val = i*moves(n/i)+1
        maxval = max(maxval,val)
    dict[n] = maxval
    return maxval

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sum = 0
    for i in a:
        sum+=moves(i)
    return int(sum)

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