import math
def solve(n):  
  
  if n == 1:
    return 1
  
  o_arr = []
  while n%2 == 0:
    o_arr.append(2)
    n /= 2

  for i in range(3,int(math.sqrt(n))+1,2):
    if n%i == 0:
      while n%i == 0:
        o_arr.append(i)
        n /= i
  if n > 2:
    o_arr.append(n)
    
  summ = 0
  temp = 1
  for i in reversed(o_arr):
    temp *= i
    summ += temp
    
  return summ+1
  
  



n = int(raw_input())
n_arr = map(int,raw_input().split())



summ = 0
for elm in n_arr:
  summ += solve(elm)
  
print summ