import collections
import math
def my_lcm(x, y):
    return (x * y) // math.gcd(x, y)


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * 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

        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 len(self.roots())

    def all_group_members(self):
        group_members = collections.defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

N =int(input())
A = list(map(int,input().split()))
CA = collections.Counter(A)
ans = N - len(CA)
ma = max(A)
mi = min(A)
uf = UnionFind(ma+1)
for i in reversed(range(2,ma+1)):
    jx = 0
    for j in range(i,ma+1,i):
        if CA[j]==1:
            if jx==0:
                jx = j
            else:
                if not uf.same(jx,j):
                    ans+=my_lcm(jx,j)
                    uf.union(jx,j)
for i in range(ma+1):
    if CA[i]==1 and not uf.same(mi,i):
        ans+=my_lcm(mi,i)
        uf.union(mi,i)
print(ans)