#!/bin/python3

import sys
import math

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    prime=[]
    r=10**4
    for m in range(2,r+1):
        k=0
        for i in range(2,m//2+1):
            if(m%i==0):
                k=k+1
        if(k<=0):
            prime.append(m)    
    sum=0        
    for i in range(len(a)):
        if a[i]==1:
            sum=sum+1
        elif a[i] in prime:
            sum=sum+a[i]+1
        else:    
            l=a[i]
            sum=sum+l
            j=0
            while l not in prime:
                if l%prime[j]==0:
                    sum=sum+l/prime[j]
                    l=int(l/prime[j])
                else:
                    if j==len(prime)-1:
                        break
                    else:    
                        j=j+1
            sum=sum+1
    return(int(sum))       
        

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