#!/bin/python

import sys
from math import *
from collections import *

primes = [True]*(10**6+1)
primes[0],primes[1] = False,False
nums = []
i = 2

while i*i<=(10**6):
    if primes[i]:
        for j in range(i*i,10**6+1,i):
            primes[j]=False
        nums.append(i)
    i+=1

def factors(x):
    power = Counter()
    ind = 0
    while ind<len(nums) and nums[ind]<=(int(sqrt(x))+1):
        if x%nums[ind]==0:
            while x%nums[ind]==0:
                power[nums[ind]]+=1
                x/=nums[ind]
        if x==1 or ceil(x//nums[ind])<nums[ind]:
            break
        ind += 1
    if x!=1:
        power[x]+=1
    return power
                

def longestSequence(a):
    ans = 0
    for val in a:
        if val==1:
            ans += 1
        else:
            p = factors(val)
            prs = sorted(p.keys(),reverse=True)
            temp = []
            for pr in prs:
                temp.extend([pr]*p[pr])
            init = 1
            x = 1
            #print temp
            for i in range(len(temp)):
                init *= temp[i]
                x += init
            #print val,x
            ans += x
            
    return ans
            

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