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

public class Solution {

    static long longestSequence(long[] a) {
        int len = a.length, flag;
        long n, r, sum = 0;
        for(int i=0;i<len;++i){
            flag = 0;
            if(a[i]==1){sum+=1;continue;}
            if(a[i]==2){sum+=3;continue;}
            r = (long)Math.sqrt(a[i]);
            for(int j=3;j<=(r+1);j+=2){
                if(a[i]%j==0){flag=1;break;}
            }
            if(flag==0) sum+=(a[i]+1);
            else{
                n = a[i];
                while(n>1){
                    sum += n/2;
                    n /= 2;
                }
                sum += a[i];
            }
        }
        return sum;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        int n = Integer.parseInt(br.readLine());
        long[] a = new long[n];
        
        st = new StringTokenizer(br.readLine());
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = Long.parseLong(st.nextToken());
        }
        
        long result = longestSequence(a);
        System.out.println(result);
        
        br.close();
        return;
    }
}