#!/bin/python3

import sys
import math

def isPrime(x):
    
    if x <= 0 :
        return 0
    
    if x == 2:
        return 1
    
    for i in range(2,(int(math.ceil(math.sqrt(x))))+1):
        if x%i == 0:
            return 0  
    return 1

def maxPrime(x):
    
    if x<=0 :
        return 0
    
    max = 1
    
    for i in range(2,x):
        
        if x%i == 0 :
            if isPrime(i) == 1:
                if max < i:
                    max = i
    return max

def maxMoves(x):
    
    if x<=0 :
        return 0
    
    if x==1 :
        return 1
    
    if isPrime(x) == 1:
        return x+1
    else:
        y = maxPrime(x)
        z = int(x/y)
        #print(str(y)+" "+str(z))
        return 1+y*maxMoves(z)
    

def longestSequence(a):
    
    ans = 0
    for x in a :
        ans = ans + maxMoves(x)
    return ans

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