def find_fact(num):
	# l = len(pr)
	temp = 1
	i=0
	ans=1
	factors=[]
	while num != 1 and i<len(pr):
		if num%pr[i]==0:
			factors.append(pr[i])
			num=num/pr[i]
		else:
			i+=1
	if num!=1:
		factors.append(num)
	factors.reverse()
	# print factors
	for i in factors:
		ans+=temp*i
		temp=temp*i
	return ans
# MOD=10**9+7

def sieve():
	prime[0] = 0
	prime[1] = 0
	for i in range(2, 10**3 + 1):
		if prime[i] == 1:
			for j in range(i*i, 10**6 + 1, i):
				prime[j] = 0

	for i in range(10**6 + 1):
		if prime[i] == 1:
			pr.append(i)			

n = int(raw_input())
arr=map(int,raw_input().split())
prime = [1]*(10**6 + 1)
pr = []
sieve()
# pr.reverse()
a=0
for i in range(n):
	a+=find_fact(arr[i])
# print pr[0:10]
print a
# print prime[:20]