#!/bin/python3

import sys
from math import sqrt
from itertools import count, islice
def isPowerOfTwo(n):
    if (n == 0):
        return False
    while (n != 1):
            if (n % 2 != 0):
                return False
            n = n // 2
             
    return True

def isPrime(n):
    if n < 2: return False
    for number in islice(count(2), int(sqrt(n)-1)):
        if not n%number:
            return False
    return True
def longestSequence(a):
    sum1=0
    for x in a:
        n=1
        if x==1:
            sum1+=1
        else:
            while True:
                z=1
                c=0
                s=range(3,int(x/2)+2,1)
                for divisor in s[::-1]:
                    if x%divisor==0 and ((not isPrime(divisor))):
                        if isPowerOfTwo(divisor):
                            z=divisor
                            break
                        elif c==0:
                            z=divisor
                            c+=1
                            
                    elif x%divisor==0 and not x%2==0 and z<divisor:
                        z=divisor
                if x==1:
                    sum1+=n
                    break
                elif z==1 and x%2==0:
                    sum1+=n
                    n*=x/2
                    sum1+=n
                    n*=2
                    sum1+=n
                    break
                elif z==1:
                    sum1+=n
                    n*=x
                    x=1
                else: 
                    sum1+=n
                    n*=x/z
                    x=z
    return int(sum1)
                
            
                
        
    #  Return the length of the longest possible sequence of moves.

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