n=int(input())
L=list(map(int,input().split()))
a=[1]*1000001
a[0]=0
a[1]=0
for i in range(2,1000):
    if (a[i]==1):
        for j in range(i*i,1000001,i):
            a[j]=0 

Premier=[]
for i in range(1000000):
    if a[i]==1:
        Premier.append(i)

def div(n):
    i=0
    while i<len(Premier) and Premier[i]<int((n**(1/2))+1)and n%Premier[i]!=0 :
        i=i+1
    if i!=len(Premier) and Premier[i]<int((n**(1/2))+1) :
      return Premier[i]
    else:
      return -1

count=0
for i in range(n):
    b=L[i]
    s=b
    
    if b<=10**6 and a[b]==1:
        s=s+1
    else:
        while b!=1:
            c=div(b)
            
            if c!=-1:
              b=b//c
              s=s+b
              if b<=10**6 and a[b]==1:
                 b=1
                 s=s+1
            elif c==-1:
              s=s+1
              b=1
            
               
    count=count+s
print(count)