#!/bin/python3

import sys
import math

dp = {1:1, 2:3}

def get_divisors(n):
    primfac = []
    d = 2
    while d*d <= n:
        while (n % d) == 0:
            primfac.append(d)  # supposing you want multiple factors repeated
            n //= d
        d += 1
    
    if n > 1:
        primfac.append(n)
    
    return set(primfac)
                 

def recursion(length):
    if length in dp:
        return dp[length]
    else:
        divs = get_divisors(length)
        max_moves = 0
        
        for div in divs:
            pieces = div
            piece_len = length // div
            temp = recursion(piece_len)
            max_moves = max(max_moves, temp * pieces)
        
        dp[length] = max_moves + 1
        return dp[length]
    
def longestSequence(a):
    ans = 0
    for choc in a:
        ans += recursion(choc)
        #print(ans)
    return ans

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)
    #for i in range(1, 100):
    #    print("{0}: {1}".format(i, recursion(i)))
    #print(dp)