# Enter your code here. Read input from STDIN. Print output to STDOUT

def sieve(n):
	"Return all primes <= n."
	np1 = n + 1
	s = range(np1) # leave off `list()` in Python 2
	s[1] = 0
	sqrtn = int(round(n**0.5))
	for i in xrange(2, sqrtn + 1): # use `xrange()` in Python 2
		if s[i]:
			# next line:  use `xrange()` in Python 2
			s[i*i: np1: i] = [0] * len(xrange(i*i, np1, i))
	return filter(None, s)

p = sieve(10**6)

n = int(raw_input())
c = map(int,raw_input().split())
ans = 0
for i in c:
    k = 0
    f = []
    while i > 1 and k < len(p):
        while i%p[k] == 0:
            i /= p[k]
            f.append(p[k])
        k += 1
    if f == []:
        #print i+1
        if i == 1:
            ans += i
        else:
            ans += i+1
    else:
        if i != 1:
            f.append(i)
        temp = [1]
        #print f
        for k in f[::-1]:
            temp.append(temp[-1]*k)
        #print temp,i
        ans += sum(temp)
print ans