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

public class Solution {
    public static boolean checkPrime(int n){
        boolean c = true;
        for(int i=2;i<=n/2;i++){
            if (n%i == 0) {
                c = false;
                break;
            }
        }
        return  c;
   }
     public static void main(String[] args) {
       Scanner sc = new Scanner(System.in);
       int t = sc.nextInt();
       int total =0;
       int all = 0;
       for (int i =0;i<t;i++ ) {
           int n = sc.nextInt();
           
           if (n == 1) {
               total = 1;
           }
           else{
                int temp = n;
                int sum =0;
                while(checkPrime(temp) != true){
                    temp = temp/2;
                    sum += temp;
                }
                total = n+sum+1;
           }
           all += total;
           
           
       }
       System.out.println(all);

   }
}