class UnionFind:
    def __init__(self, n):
        self.parent = list(range(n)) #親ノード
        self.size = [1]*n #グループの要素数
 
    def leader(self, x): #leader(x): xの根ノードを返す．
        while self.parent[x] != x:
            self.parent[x] = self.parent[self.parent[x]]
            x = self.parent[x]
        return x 
 
    def merge(self, x, y): #merge(x,y): xのいる組とyのいる組をまとめる
        x, y = self.leader(x), self.leader(y)
        if x == y: return -1
        if self.size[x] < self.size[y]: #xの要素数が大きいように
            x,y=y,x
        # yを x につなぐ
        self.size[x] += self.size[y]
        self.parent[y] = x
        return x
 
    def issame(self, x, y): #same(x,y): xとyが同じ組ならTrue
        return self.leader(x) == self.leader(y)
        
    def getsize(self,x): #size(x): xのいるグループの要素数を返す
        return self.size[self.leader(x)]

    def all_leaders(self): # 全てのリーダーのリストを返す
        return [i for i,v in enumerate(self.parent) if i==v]
        
    def groups(self): # 全ての連結成分からなるリストを返す
        n = len(self.parent)
        gp = [[] for _ in range(n)]
        for v in range(n):
            gp[self.leader(v)].append(v)
        return [lst for lst in gp if lst]


import sys
readline = sys.stdin.readline

#n = int(readline())
#*a, = map(int,readline().split())
# ab = [list(map(int,readline().split())) for _ in range()]
# S = readline().strip()
# b = [readline().strip() for _ in range()]

n = int(readline())
*a, = map(int,readline().split())

M = 10**5
ans = 0
cnt = [0]*(M+1)
for ai in a:
    if cnt[ai] == 0:
        cnt[ai] = 1
    else:
        ans += ai

from math import gcd

edges = []
for d in range(1,M+1):
    v0 = -1
    for v in range(d,M+1,d):
        if v0 == -1 and cnt[v]:
            v0 = v
        if v != v0 and cnt[v]:
            edges.append((v0*v//gcd(v0,v),v0,v))


edges.sort(key=lambda lst:lst[0])
UF = UnionFind(M+1)

num = sum(cnt)

for c,x,y in edges:
    if UF.merge(x,y) != -1:
        num -= 1
        ans += c
    if num == 1:
        break

print(ans)