#!/bin/python3

import sys
def prime(b):
    c=0
    for i in range(2,b):
        if b%i==0:
            c=c+1
            break
       
            
        else:
            c=0
    if c==1:
        return 0
    elif c==0:
        return 1
                
                
    
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    l=len(a)
    res=0 
    for i in range(l):
     
        if a[i]==1:
            res=res+1
        elif a[i]>1:
            x=prime(a[i])
            if x==1:
                res=res+a[i]+1
            elif x==0:
                s1=r=a[i]
               
                if a[i]%2==0:
                   
                    while(r!=1):
                        r=r//2
                        s1=s1+(r)
                elif a[i]%3==0:
                    while(r!=1):
                        r=r//3
                        s1=s1+r
                elif a[i]%5==0:
                     while(r!=1):
                        r=r//5
                        s1=s1+r
                res=res+s1        
                    
                    
              
 
                    
    return res      
        

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