# Python program to print all primes smaller than or equal to
# n using Sieve of Eratosthenes
 
def prim(n):
    l=[]
    prime = [True for i in range(n+1)]
    p = 2
    while (p * p <= n):
        if (prime[p] == True): 
            for i in range(p * 2, n+1, p):
                prime[i] = False
        p += 1
    for p in range(2, n):
        if prime[p]:
            l.append(p)
    return l
import sys

def longestSequence(a):
    b=[]
    for i in a:
        if i==1:
            b.append(1)
        elif i in prim(i+1):
            b.append(i+1)
        if i%2==0:
            b.append(1)
            b.append(i/2)
            b.append(i)
            if (i/2)%2==0:
                b.append(i/4)
                if (i/4)%2==0:
                    b.append(i/8)
                    if (i/8)%2==0:
                        b.append(i/16)
    return sum(b)


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