#!/bin/python3

import sys
import math
def isPrime(n):
    for i in xrange(2, int(math.ceil(math.sqrt(n)))+1):
        if n%i == 0:
            return False
        
    return True
        

def longestSequence(a):
    cost = 0
    for i in a:
        while i != 1:
            if i%2 == 0:
                cost += i
                i //= 2
                
            else:
                if isPrime(i):
                    cost += i
                    i = 1
                    
                else:
                    for j in xrange(2,i+1):
                        if i%j == 0:
                            oddDiv = j
                            break
                            
                    cost += i
                    
                    i //= oddDiv
                    
            #print(i, cost)
        
        cost += 1  
        
    return cost
                
            
    

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