n=input()
x=map(int,raw_input().split())
def div(k):
    y=[]
    for i in range(1,int(k**0.5)+1):
        if k%i==0:
            if k/i==i:
                y.append(i)
            else:
                y.append(i)
                y.append(k/i)
    y.sort()
    return y
# print div(n)
def grun(n):
        d={}
        l=div(n)
        d[l[0]]=n
        for i in range(len(l)):
            m=-9999999999
            for j in range(i):
                if l[i]%l[j]==0:
                    if d[l[j]]>m:
                        m=d[l[j]]
                        d[l[i]]=m+n/l[i]
        return d[l[i]]
def answer():
    sum=0
    for i in x:
        sum+=grun(i)
    print sum

answer()