from math import gcd

class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.group = n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return
        self.group -= 1
        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

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

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

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return self.group

    def all_group_members(self):
        dic = {r:[] for r in self.roots()}
        for i in range(self.n):
            dic[self.find(i)].append(i)
        return dic

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

n = int(input())
A = list(map(int, input().split()))
A.sort()
ma = A[-1]
B = []
bef = -1
ans = 0
ind = [-1] * (ma + 1)
l = 0
for a in A:
    if a == bef:
        ans += a
    else:
        B.append(a)
        bef = a
        ind[a] = l
        l += 1

edges = set()
for i in range(1, ma + 1):
    ii = -1
    for j in range(i, ma + 1, i):
        if ind[j] != -1:
            if ii == -1:
                ii = ind[j]
            else:
                jj = ind[j]
                edges.add((B[ii] * B[jj] // gcd(B[ii], B[jj]), ii, jj))


edges = sorted(edges)
UF = UnionFind(n)
for c, i, j in edges:
    if not UF.same(i, j):
        ans += c
        UF.union(i, j)
print(ans)