import bisect
import math

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    N = int(data[0])
    A = list(map(int, data[1:N+1]))
    A.sort()
    total = 0
    prev_min = A[0]
    for i in range(1, N):
        if A[i] == A[i-1]:
            total += A[i]
        else:
            idx = bisect.bisect_left(A, A[i], 0, i)
            if idx < i and A[idx] == A[i]:
                total += A[i]
            else:
                g = math.gcd(A[i], prev_min)
                lcm = (A[i] * prev_min) // g
                total += lcm
    print(total)

if __name__ == "__main__":
    main()