from sys import stdin

def sum_div(n):
	res = n
	d = 2
	while n > 1:
		while n % d == 0:
			n /= d
			res += n
		d += 1
		if d*d > n:
			if n > 1:
				res += 1
			break
	return res

def solve():
    prime = [True]*(10**6+1)
    prime[1] = False
    p = []
    for i in xrange(2, 10**6+1):
        if prime[i]:
            p.append(i)
            for j in xrange(2, 10**6/i+1):
                prime[i*j] = False
    n = int(stdin.readline().strip())
    a = map(int, stdin.readline().strip().split())
    ans = 0
    for k in a:
        ans += sum_div(k)
    print ans

solve()