#!/bin/python3

import sys
import math

def isprime(i):
    flag=0
    for l in range (2, int(i)):
        if i%l==0:
            flag=1
            return 0
        else:
            continue
    if flag == 0:
        return 1

def longestSequence(a):
    sum=0
    #  Return the length of the longest possible sequence of moves.
    for i in a:
        while i>0:
            if i==1:
                sum=sum+1
                break
            elif isprime(i):
                sum=sum+i+1;
                break
            else:
                sum=sum+i
                i =i/2
                round(i)
    return int(sum)

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