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()))

X = [[] for _ in range(U)]
for i, a in enumerate(A):
    X[a].append(i)

E = []
for d in range(1, U):
    idx = []
    for i in range(d, U, d):
        idx.extend(X[i])
    if not idx:
        continue
    i, *idx = idx
    for j in idx:
        E.append((i, j, A[i] * A[j] // d))

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