from math import gcd

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

p1 = [7,14,2,4,8,16,12,6,18,9,3,15,5,10,20]
p2 = [12,6,18,9,3,15,5,10,20,16,8,4,2,14,7]
o = [1,11,13,17,19]

counts = [0 for _ in range(21)]

for a in A:
    counts[a] += 1

res1 = sum(counts[a] for a in o)
for x in p1:
    if counts[x]:
        res1 += (counts[x] - 1) * x
px = [a for a in p1 if counts[a]]
for x, y in zip(px, px[1:]):
    res1 += gcd(x, y)

res2 = sum(counts[a] for a in o)
for x in p2:
    if counts[x]:
        res2 += (counts[x] - 1) * x
px = [a for a in p2 if counts[a]]
for x, y in zip(px, px[1:]):
    res2 += gcd(x, y)

print(max(res1, res2))
