def GCD(x,y):
    if x>y:
        x,y=y,x
    Lx=len(bin(x))
    Ly=len(bin(y))
    if x!=0:
        return GCD(x,y^(x<<(Ly-Lx)))
    else:
        return y
def usable(x,g):
    Lx=len(bin(x))
    Lg=len(bin(g))
    while Lx>=Lg:
        x^=g<<(Lx-Lg)
        Lx=len(bin(x))
    return x==0

N = int(input())
A =list(map(int,input().split()))

S=sum(A)
M=max(A)
mi=[0]
for i in range(M):
    mi.append(0)
G=0
for i in range(N):
    G=GCD(G,A[i])
    j=1
    while j*j<=A[i]:
        if A[i]%j==0:
            mi[j]+=A[i]-A[i]//j
            if j*j!=A[i]:
                mi[A[i]//j]+=A[i]-j
        j+=1
    
X=S
for i in range(2,M+1):
    if(usable(i,G)):
        X=min(X,S-mi[i])
print(X)