#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    if not a:
        return 0
    ans = 0
    dp = [0] * (max(a)+1)
    dp[0] = 0
    dp[1] = 1
    dp[2] = 3
    for num in a:        
        for i in range(3,num+1):
            maxMove = 0
            if i % 2 == 1:
                dp[i] = 1 + i
            else:
                n = int(i/2)
                while n > 0:
                    r = int(i/n)
                    index = int(i/r)
                    maxMove = max(maxMove, 1+r*dp[index])
                    n -= 1
                dp[i] = maxMove
                    
    for num in a:
        ans += dp[num]
    return ans

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