class Unionfind:
     
    def __init__(self,n):
        self.uf = [-1]*n
 
    def find(self,x):
        if self.uf[x] < 0:
            return x
        else:
            self.uf[x] = self.find(self.uf[x])
            return self.uf[x]
 
    def same(self,x,y):
        return self.find(x) == self.find(y)
 
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.uf[x] > self.uf[y]:
            x,y = y,x
        self.uf[x] += self.uf[y]
        self.uf[y] = x
        return True
 
    def size(self,x):
        x = self.find(x)
        return -self.uf[x]


n = int(input())
A = list(map(int,input().split()))
M = 10**5+5
ans = 0
count = [0]*M
for a in A:
    if count[a]:
        ans += a
    else:
        count[a] = 1


edge = []
uf = Unionfind(M)
for i in range(1,M):
    find = 0
    for j in range(i,M,i):
        if count[j] == 0:
            continue
        if find:
            edge.append([j*find//i,find,j])
        else:
            find = j

edge.sort()
for cost,x,y in edge:
    if uf.union(x,y):
        ans += cost
print(ans)