n = int(input())
A = map(int, input().split())

def genPrime(n):
	""" Returns  a list of primes < n """
	sieve = [True] * n
	for i in range(3,int(n**0.5)+1,2):
		if sieve[i]:
			sieve[i*i::2*i]=[False]*((n-i*i-1)//(2*i)+1)
	return [2] + [i for i in range(3,n,2) if sieve[i]]

primes = genPrime(1000000)

def solve(a):
	#factors=dict()
	factors=[]
	for p in primes:
		while (a%p==0):
			factors.append(p)
			#if (p in factors):
				#factors[p]+=1
			#else:
				#factors[p]=1
			a = a//p

	if (a>1):
		factors.append(a)

	factors.sort(reverse=True)
	#print(factors)

	s = 1
	total =1
	for p in factors:
		s *= p
		total += s

	#print(total)
	return total

print(sum(solve(a) for a in A))