import java.util.*;

public class Solution {
	
	private static Map<Long,Long> mp;
	private static List<Integer> primes;

    static long longestSequence(long[] a) {
       long finalResult = 0;
       
       for(int i=0;i<a.length;i++){
    	   if(isPrime(a[i])){
      		finalResult=finalResult+a[i]+1;
          }
    	    else{
        	finalResult  =  longestValue(a[i],finalResult,1)+a[i];
       }
       }
       return finalResult;
       
    }
    private static  List<Integer> primesUpTo(int n)
    {
    	List<Integer> pNum = new ArrayList<Integer>();
        boolean prime[] = new boolean[n+1];
        for(int i=0;i<n;i++)
            prime[i] = true;
         
        for(int p = 2; p*p <=n; p++)
        {
            // If prime[p] is not changed, then it is a prime
            if(prime[p] == true)
            {
                // Update all multiples of p
                for(int i = p*2; i <= n; i += p)
                    prime[i] = false;
            }
        }
         
        // Print all prime numbers
        for(int i = 2; i <= n; i++)
        {
            if(prime[i] == true)
            	pNum.add(i);
        }
        
        return pNum;
    }
     
    
    
    static long longestValue(long value, long finalResult,long peices){
    	
    	if(value == 1)
    		return finalResult;
    	
    	long largestPrimeDivisor =1;
    	if(value>99999){
    		largestPrimeDivisor = hugePrimeFactor(value);
    		if(largestPrimeDivisor==1){
    			largestPrimeDivisor = largestPrimeFactor(value);
    		}
    	}else{
    		largestPrimeDivisor = largestPrimeFactor(value);
    	}
    	long divisor=1;
    	if(largestPrimeDivisor==2){
        divisor = 1;
    	for(int i=1;i<=39;i++){
    		divisor = divisor*largestPrimeDivisor;
    		if(divisor >= value){
    			divisor=divisor/largestPrimeDivisor;
    			break;
    		}
    		if(value%(divisor)!=0){
    			divisor=divisor/largestPrimeDivisor;
    			break;
    		}
    	}
    	}else{
    		divisor=value/largestPrimeDivisor;
    	}
    	
    	finalResult=finalResult+peices;
    	finalResult=longestValue(divisor,finalResult,peices*(value/divisor));
    	
    	return finalResult;
    }
    
    public static long largestPrimeFactor(long number) {
    	for(int i = primes.size()-1;i>=0;i--){
    		if(number%primes.get(i)==0)
    			return primes.get(i);
    	}
        return number;
    }
    
    public static long hugePrimeFactor(long number) {

        for(int j=0;j<Math.sqrt(number);j++){
         if(j<primes.size()-1)
		 while(number%primes.get(j)==0){
			 number=number/primes.get(j);
		 }
	 } 
    
    	 return number;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        primes = primesUpTo(1000000);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
    
    static boolean isPrime(long n) {
        //check if n is a multiple of 2
    	if(n==1)
    		return false;
    	if(n==2 || n==3)
    		 return true;
    	
        if (n%2==0) return false;
        //if not, then just check the odds
        for(long i=3;i*i<=n;i+=2) {
            if(n%i==0)
                return false;
        }
        return true;
    }
    
}