#!/bin/python3

import sys
def f(n):
    for num in range(2,n+1):
        if n % num == 0:
            return num
def longestSequence(a):
    c=0
    
    for i in a:
        s=i
        p=0
        if(s!=1):
            p=f(s)
            while(s!=1):
               
                c+=s
                s//=p
                
                p=f(s)
               
            
        else:
            c+=0
        
        c+=1
      
    return c
            

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