def grfactor(n):

	x =int(n**0.5) +1 
	for i in range(2,x):
		if n%i == 0:
			return i
		if n%(i+2) == 0:
			return (i+2)	
	else:
		return n		



N = int(input())
A = map(int,input().split())
ans = 0
answe = {1:1}
for i in A:
	k = 1
	if i in answe:
		ans += answe[i]
		


	else:
		#cl = [1]*i
		clr = i #which is the len of cl
		ext = 0
		while clr != 1: #len(cl) != 1:
			
			#le = len(cl)
			le = clr
			a = grfactor(le)
			clr = (int(le/a))
			#cl = [sum(cl[:a])]*(int(le/a))
			ans += (int(le/a))
			ext += (int(le/a))

			

		ans += i	
		ext += i	
		answe[i] = ext


print(ans)