#!/bin/python3
import sys

maxlist = []
sum = 0
def longestSequence(a):
	result = 0
	summoves = 0
	for x in a:
		result += countMoves(x)
	return result
    #  Return the length of the longest possible sequence of moves.

def countMoves(x):
	if x == 1:
		return 1

	if is_prime(x):
		return x + 1

	factors = get_factors(x)
	global sum
	max = 0
	for a in factors:
		p = countMoves(a)
		sum += 1 + x/a * p
		maxlist.append(sum)
		if sum > max:
			max = sum
		sum = 0
	return max

def is_prime(a):
    x = True 
    for i in range(2, a):
       if a%i == 0:
           x = False
           break 
    return x

def get_factors(x):
   factors = []
   for i in range(2, x//2 + 1):
       if x % i == 0:
           factors.append(i)
   return factors

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(int(result))