#!/bin/python3

import sys
def smallestprime(n):
    #Return the smallest prime number of n
    if n==1 or n==2 or n==3 :
        return ''
    else:
        for i in range(2,int(n**(0.5))+1):
            if n%i==0:
                i=str(i)
                return i
        return ''

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sume=0
    for n in a:
        
        primelist=[]
        t=n
        while(smallestprime(t)!=''):
            primelist+=[int(smallestprime(t))]
            t=t/int(smallestprime(t))
        primelist+=[t]
        primelist.sort()
        su=0
        for i in range(len(primelist)):
            s=1
            for j in range(i+1):
                s*=primelist[len(primelist)-1-j]
            su+=s
        sume+=(su+1)
        if n==1:
            sume-=1
        
    return(int(sume))
            
        
        
            
        

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