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)

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.sort(key=lambda x:x[0])
uf=UnionFind(m+1)
for c,x,y in edge:
  if not uf.same(x,y):
    ans+=c
    uf.union(x,y)

print(ans)