from collections import defaultdict

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 same(self,x,y):
    return self.find(x)==self.find(y)

def compare(a,b):
  # 比較関数 (a<=b)
  return a[0]<=b[0]


def merge(l, r):
    new = []
    ln = 0
    rn = 0
    while ln < len(l) and rn < len(r):
        if compare(l[ln],r[rn]):
            new.append(l[ln])
            ln += 1
        else:
            new.append(r[rn])
            rn += 1
    for i in range(ln, len(l)):
        new.append(l[i])
    for i in range(rn, len(r)):
        new.append(r[i])
    return new
 
def MergeSort(l):
    if len(l) == 0:
        return []
    if len(l) == 1:
        return l
    else:
        a = l[:len(l)//2]
        b = l[len(l)//2:]
        return merge(MergeSort(a), MergeSort(b))

n=int(input())
a=list(map(int,input().split()))
m=10**5+1
cnt=[0]*m
ans=0
for i in a:
  if cnt[i]==0:
    cnt[i]=1
  else:
    ans+=i

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

edge=MergeSort(edge)
uf=UnionFind(m+1)
for c,x,y in edge:
  if not uf.same(x,y):
    ans+=c
    uf.union(x,y)

print(ans)