from operator import itemgetter


class UF_tree:
    def __init__(self, n):
        self.root = [-1] * (n + 1)
        self.rank = [0] * (n + 1)

    def find(self, x):
        stack = []
        while self.root[x] >= 0:
            stack.append(x)
            x = self.root[x]
        for i in stack:
            self.root[i] = x
        return x

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.rank[x] < self.rank[y]:
            self.root[y] += self.root[x]
            self.root[x] = y
        else:
            self.root[x] += self.root[y]
            self.root[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
        return True

    def size(self, x):
        return -self.root[self.find(x)]


U = 10 ** 5 + 10
N = int(input())
A = list(map(int, input().split()))

ans = 0
uf = UF_tree(N)

X = [-1] * U
for i, a in enumerate(A):
    if X[a] == -1:
        X[a] = i
    else:
        uf.unite(i, X[a])
        ans += a

E = []
for d in range(1, U):
    p = -1
    for i in range(d, U, d):
        if X[i] == -1:
            continue
        if p == -1:
            p = X[i]
        else:
            E.append((p, X[i], A[p] * A[X[i]] // d))

E.sort(key=itemgetter(2))
for a, b, c in E:
    if uf.unite(a, b):
        ans += c

print(ans)