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

public class Solution {

    static boolean isPrime(long n) {
        for(long i=2;2*i<n;i++) {
            if(n%i==0)
                return false;
        }
        return true;
    }
    static long longestSequence(long[] a) {
        long m = 0;
        for (int i=0;i<a.length;i++){
            m +=a[i];
            if (a[i] > 1){
                if (isPrime(a[i])){
                    m+=1;
                }else{
                    while(a[i] > 1){
                        long myMove = a[i]/2 ;
                        m +=myMove;
                        a[i] = myMove;
                    }
                }
            }
        }
        return m ;
    }

    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();
    }
}