#!/bin/python

import sys
def des(a):
   
    for i in range (2,int(a**0.5)+1):
        if a%i ==0 : return i
    return 0   
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    s=0
    for i in range (len(a)):
        x=a[i]
        s+=x
        d=des(x)
        while d:
            s+=x//d
            x=x//d
            d=des(x)
            
        if x>1 :s+=1
         
        
        
    return s   

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