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 MST(n,edge):
  uf=UnionFind(n)
  ans=0
  for cost,u,v in edge:
    if not uf.same(u,v):
      ans+=cost
      uf.union(u,v)
  return ans

import math
import random
n=int(input())
a=list(map(int,input().split()))
#n=5*10**5
#a=[random.randint(50000,10**5) for i in range(n)]
m=10**5
d=[-1]*(m+1)
cnt=[0]*(m+1)

ans=0
for i in a:
  if cnt[i]==0:
    cnt[i]=1
  else:
    ans+=i

edge=[]
for i in range(1,m+1):
  for j in range(i,m+1,i):
    if cnt[j]==1:
      if d[i]==-1:
        d[i]=j
      else:
        edge.append((d[i]*j//i,d[i],j))

edge.sort(key=lambda x:x[0])
ans+=MST(m+1,edge)
print(ans)