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

public class Solution {
static long longestSequence(long[] a) {
        long result = 0 ;
        //finding the highest power of 2 that divides no.
        for (int l=0;l<a.length;l++){
            long temp = a[l];
            long nodeVal = 1;
            if (temp%2==0) {
                while (temp != 0) {
                    if (temp % 2 == 0) {
                        nodeVal=nodeVal*2;
                        temp = temp / 2;
                    }
                    else break;
                }
                long dividend  = a[l]/nodeVal;
                result=result+1+dividend*(nodeVal*2-1);
            }
            else {
                //case of odd no.
                for (int i=3;i<=(long)Math.sqrt(a[l]);i++){
                    if (a[l]%i==0) {
                        nodeVal = i;
                        break;
                    }
                }
                if (a[l]==1)
                    result+=1;
                else if (nodeVal == 1)
                    result = result+1+a[l];
                else
                {
                    long div  = a[l]/nodeVal;
                    result = result + 1 + div*(1+nodeVal);
                }
            }
        }
        return result;
    }


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