def is_prime(n):
    """
    Assumes that n is a positive natural number
    """
    # We know 1 is not a prime number
    if n == 1:
        return False

    i = 2
    # This will loop from 2 to int(sqrt(x))
    while i*i <= n:
        # Check if i divides x without leaving a remainder
        if n % i == 0:
            # This means that n has a factor in between 2 and sqrt(n)
            # So it is not a prime number
            return False
        i += 1
    # If we did not find any factor in the above loop,
    # then n is a prime number
    return True




raw_input()
A = map(long, raw_input().split())
ans = 0
for p in A:
    i = p
    if(is_prime(i)):
        ans += i
    else:
        k=1
        while(i!=1):
            if(is_prime(i)):
                k = k*i
                ans += k
                i = 1
            elif(i%2==0):
                k = k *2
                ans += k
                i = i/2
            else:
                cp = 0
                for j in range(3,i):
                    if(i%j == 0):
                        cp = i/j
                k = cp*k
                ans += k
                i = cp
print ans+1