#!/bin/python

import sys
import math

def longestSequence(a):
    s = 0
    for n in a:
        s += n
        #  Return the length of the longest possible sequence of moves.
        factors = []
        for i in range(2, int(math.sqrt(n)) + 1):
            c = 0
            while n % i == 0:
                n /= i
                c += 1
            factors.append((i, c))
        if n != 1:
            factors.append((n, 1))
        factors.reverse()
        p = 1
        for i in range(len(factors)):
            for j in range(factors[i][1]):
                s += p
                p *= factors[i][0]
        
    return s

if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(long, raw_input().strip().split(' '))
    result = longestSequence(a)
    print result