import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long count = 0;
        for(int i=0;i<a.length;i++){
                count +=1;
                if(a[i]==1){
                    
                }
                else if(a[i]%2 == 0 || !isprime(a[i])){
                    count += recursionSequence(a[i]);
                }
                else if(isprime(a[i])){
                        count += a[i];
                    }
                }
        
               
            return count;
            }
        

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        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();
        
    }
    
    private static boolean isprime(long num){
        int count=0;
        for(long k=2;k<= Math.sqrt(num);k++){
            if(num%k == 0)
                count++;
        }
        if(count == 0){
         //   System.out.println(num + " is prime" + count);
            return true;
        }
            
        else{
           //  System.out.println(num + " is not prime" + count);
            return false; 
        }
             
    }
    
    private static long maxdivisor(long num){
        long divisor = 1;
        for(long k=num/2;k>=2;k--){
            if(ispower2(k)){
                divisor = k;
                break;
            }
                
        }
        //System.out.println("divisor is "+ divisor);
        return divisor;
    }
    
    private static boolean ispower2(long num){
        
       return num!=0 && (( num& num-1 )== 0);
        
    }
    
    private static long recursionSequence(long num){
            if(num == 1)
                return 0;
            else{
                long divisor = maxdivisor(num);
                return (num/divisor) + (num/divisor)*recursionSequence(divisor);
            }
    }
}