# Enter your code here. Read input from STDIN. Print output to STDOUT
def findFactors(n):
    res1 = []
    res2 = []
    for i in range(2,int(n**0.5)+1):
        if(n%i==0):
            res1.append(int(i))
            res2.append(int(n/i))
    return res1 + res2[::-1]


def maxsq(a):
    factors = findFactors(a)
    lenF = len(factors)
    if lenF==0:
        if(a==1):
            return 1
        return a+1
    
    maxvals = [0 for i in range(lenF)]
    for i in range(lenF):
        facfac = False
        maxval = 0
        for z in range(i):
            if(factors[i]%factors[z]==0):
                facfac = True
                #val = (facfac[-1-z] * maxvals[factors.index(facfac[z])]) + 1
                val = 1 + maxvals[z]*(factors[i]//factors[z])
                if(maxval < val):
                    maxval = val
        maxvals[i] = maxval
        
        #facfac = findFactors(factors[i])
               
        if(not facfac):
            maxvals[i] = factors[i]+1
            continue
        '''
        maxval = 0
        for z in range(len(facfac)):
            val = (facfac[-1-z] * maxvals[factors.index(facfac[z])]) + 1
            if(maxval < val):
                maxval = val
        maxvals[i] = maxval
        '''
    finalarr = [maxvals[i]*factors[lenF-1-i]+1 for i in range(lenF)]
    return max(finalarr)

def longestSequence(a):
    score = [maxsq(i) for i in a]
    #print(score)
    return(int(sum(score)))


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


#print(findFactors(15625))