n = int(raw_input()) arr = map(int,raw_input().split()) dp = {1:1} def findMaxMoves(num): if num in dp: return dp[num] i = 2 totalMoves = 0 prime = True while i*i <= num: if num%i == 0: totalMoves = num + findMaxMoves(num/i) prime = False break i += 1 if prime: dp[num] = num + 1 else: dp[num] = totalMoves return dp[num] maxMoves = 0 for number in arr: maxMoves += findMaxMoves(number) print maxMoves