#!/bin/python3

import sys
import math 

def diviseurs(x):
    dlist = []
    lim = 1+int(math.sqrt(x))
    for i in range(2, lim):
        if x%i==0:
            dlist.append(i)
            if i!=x//i:
                dlist.append(x//i)
    return dlist

#f(3)=4
#f(2)=3
#f(6),dlist=[2,3],v=[2+f(3), 3+f(2)]=[6,6],max=6
def f(x):
    #print(x)
    dlist = diviseurs(x)
    if len(dlist)==0:
        if x == 1:
            return x
        return int(1+x)
    v = [1+d*f(x/d) for d in dlist]
    return int(max(v))
        
    
        
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    s = [f(x) for x in a]
    return sum(s)
    
    

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