#!/bin/python3

import sys
def largestprimefact(n):
    factors = []
    d = 2
    while n > 1:
        while n % d == 0:
            factors.append(d)
            n //= d
        d = d + 1
        if d*d > n:
            if n > 1: factors.append(n)
            break
    return factors
def longestSequence(a):
    anstemp=len(a)
    for u in a:
        temp=u
        ans=1
        l=largestprimefact(temp)
        l=l[::-1]
        for b in l:
            temp//=b
            ans*=b
            anstemp+=ans
    return anstemp
        
    #  Return the length of the longest possible sequence of moves.

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