#!/bin/python

import sys

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 is_power2(num):

	'states if a number is a power of two'

	return num != 0 and ((num & (num - 1)) == 0)
def get_factor(n):
    s = n//2
    for i in range(s,1,-1):
        if n%i==0 and is_power2(i):
            return i
def get_count(i):
    if i==2:
        return 2
    elif isprime(i):
        return i+1
    else:
        f = get_factor(i)
        l = i//f + (i//f)*get_count(f)
        return l
    
def longestSequence(a):
    sumi = 0
    for i in a:
        if(i==1):
            sumi = sumi + 1
        elif isprime(i):
            sumi = sumi + i+1
        else:
            sumi = sumi + get_count(i)+1
    return sumi
                
            
    
if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(long, raw_input().strip().split(' '))
    result = longestSequence(a)
    print result