#!/bin/python3

import sys
import math

def isPrime(num):                                   
    for i in range(3,int(math.sqrt(num) + 1),2):              
        if num%i == 0:                                 
            return False                                        
    return True

def returnDivisor(number):
    for i in range(3, int(math.sqrt(number) + 1)):
        if(number%i == 0):
            return i
        
def longestSequence(a):
    moves = 0
    for i in range(len(a)):
        current_length = a[i]
        while(current_length):
            if(current_length == 1):
                moves += 1
                current_length = 0
            elif(current_length %2 == 0):
                moves += current_length
                current_length = current_length/2    
            elif(isPrime(current_length)):
                moves += current_length + 1
                current_length = 0
            else:
                moves += current_length
                divisor = returnDivisor(current_length)
                current_length = current_length/divisor
    return moves
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(int(result))