mod = 998244353
NN = 10 ** 5


def main():
    import sys
    from collections import Counter
    input = sys.stdin.readline

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

        def find_root(self, x):
            while self.root[x] >= 0:
                x = self.root[x]
            return x

        def unite(self, x, y):
            x = self.find_root(x)
            y = self.find_root(y)
            if x == y:
                return
            elif self.rnk[x] > self.rnk[y]:
                self.root[x] += self.root[y]
                self.root[y] = x
            else:
                self.root[y] += self.root[x]
                self.root[x] = y
                if self.rnk[x] == self.rnk[y]:
                    self.rnk[y] += 1

        def isSameGroup(self, x, y):
            return self.find_root(x) == self.find_root(y)

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

    div = [[] for _ in range(NN + 1)]
    for d in range(1, NN + 1):
        for x in range(1, NN + 1):
            if d * x > NN:
                break
            div[d * x].append(d)

    N = int(input())
    A = list(map(int, input().split()))

    C = Counter(A)
    ans = 0
    A_sorted = sorted(list(set(A)))
    D = [[] for _ in range(NN + 1)]
    for i, a in enumerate(A_sorted):
        ans += a * (C[a] - 1)
        for d in div[a]:
            D[d].append(a)

    if len(A_sorted) == 1:
        print(ans)
        exit()

    UF = UnionFind(NN)
    E = []
    for d in range(1, NN + 1):
        if len(D[d]) > 1:
            a0 = D[d][0]
            for a in D[d][1:]:
                E.append((a * a0 // d, a, a0))
    E.sort(key=lambda x: x[0])
    for x, a, b in E:
        if UF.isSameGroup(a, b):
            continue
        ans += x
        UF.unite(a, b)
    print(ans)


if __name__ == '__main__':
    main()