#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    ans=0
    for i in a:
        ans+=1
        arr1={}
        num=i
        for k in l:
            if(k>num):
                arr1[num]=1
                num=1
                break
            elif(num%k==0):
                c=0
                while(num%k==0):
                    c+=1
                    num=num//k
                arr1[k]=c
        if(num!=1):
            arr1[num]=1
            num=1
        l1=arr1.keys()
        l1=sorted(l1,reverse=True)
        num1=1
        #print(l1)
        #print(arr1)
        for j in l1:
            if(j==1):
                break
            for k in range(arr1[j]):
                ans+=num*j
                num*=j
            #print(num,"****")
    return ans

arr=[0]*1000000
l=[]
for i in range(2,50000):
    if(arr[i]==0):
        for j in range(2*i,50000,i):
            arr[j]=1
        l.append(i)
n = int(input().strip())
a = list(map(int, input().strip().split(' ')))
result = longestSequence(a)
print(result)