from heapq import heappush, heappop, heapify
def MST(n,edge):
  used=[0]*n
  todo=edge[0].copy()
  used[0]=1
  heapify(todo)
  ans=0
  while todo:
    cost,v=heappop(todo)
    if used[v]:
      continue
    used[v] = 1
    ans+=cost
    for c,w in edge[v]:
      if used[w]:
          continue
      heappush(todo,(c,w))
  return ans

n=int(input())
a=list(map(int,input().split()))
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


id=[-1]*(m+1)
size=0
for i in range(m+1):
  if cnt[i]:
    id[i]=size
    size+=1
edge=[[] for i in range(size)]
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:
        id1=id[j]
        id2=id[d[i]]
        edge[id1].append((d[i]*j//i,id2))
        edge[id2].append((d[i]*j//i,id1))

ans+=MST(size,edge)
print(ans)