#!/bin/python3

import sys
import math

def divisors(n):
    divs = [1]
    for i in range(2,int(math.sqrt(n))+1):
        if n%i == 0:
            divs.extend([i,n/i])
    divs.extend([n])
    return list(set(divs))

def isprime(n):
    n = abs(int(n))
    if n < 2:
        return False
    if n == 2: 
        return True    
    if not n & 1: 
        return False
    for x in range(3, int(n**0.5) + 1, 2):
        if n % x == 0:
            return False
    return True

def longestSequence(a):
    r = 0
    for e in a :
        if e == 1 :
            r += 1
        elif isprime(e) :
            r += e+1
        elif e%2 == 0:
                x = 0
                while e > 0 :
                    x += e
                    e = e // 2
                r += x
        #else :
            
                
    return r
                    
            

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