from math import gcd
N=int(input())
A=list(map(int,input().split()))
A.sort()
S=set()
B=[]
ANS=0
for i in range(N):
  if A[i] in S:
    ANS+=A[i]
  else:
    B.append(A[i])
    S.add(A[i])
INF=10**12
N=len(B)
V=[INF]*123456
W=[INF]*N
D=[[] for i in range(100001)]
for i in range(1,100001):
  for j in range(i,100001,i):
    D[j].append(i)
for i in range(N):
  for j in range(len(D[B[i]])):
    W[i]=min(W[i],V[D[B[i]][j]])
    V[D[B[i]][j]]=min(V[D[B[i]][j]],A[i]//D[B[i]][j])
V=[INF]*123456
for i in range(N-1,-1,-1):
  for j in range(len(D[B[i]])):
    W[i]=min(W[i],V[D[B[i]][j]])
    V[D[B[i]][j]]=min(V[D[B[i]][j]],A[i]//D[B[i]][j])
X=[W[i]*B[i] for i in range(N)]
print(sum(X)-min(X)+ANS)