import sys
import math

def primeFactors(n):
    sum=n
    while n % 2 == 0:
        n = n / 2
        sum+=n
    for i in range(3, int(math.sqrt(n)) + 1, 2):
        while n % i == 0:
            n = n / i
            sum+=n
    if n > 2:
        sum+=n%2
    return int(sum)

def longestSequence(a):
    n=len(a)
    sum=0
    for i in range(n):
        num=a[i]
        k=primeFactors(num)
        sum+=k
    return int(sum)


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