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

public class Solution {

    public static long smallestdivisor(long n){
         
        for(long i=3;i<=Math.sqrt(n);i+=2){
            if(n%i==0){
                return i;
            }
        }
        return -1;
    }
  public static boolean isPrime(long n)
{
  
    if (n <= 1) 
        return false;
    if (n <= 3)  
        return true;


    if (n%2 == 0 || n%3 == 0)
        return false;

    for (long i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;

    return true;
}
    static long longestSequence(long[] a) {
        
        long sum=0;
        for(int i=0;i<a.length;i++){
            long n=a[i];
            long ans=0;
             
            if(n==1){
                ans+=1;
                sum+=ans;
                continue;
            }
            while(n!=0){
                if(isPrime(n)){
                    ans+=(n+1);
                    break;
                }else if((n&1)==1){
                    ans+=n;
                    n/=(smallestdivisor(n));
                }else{
                    ans+=n;
                    n/=2;
                }
            }
            sum+=ans;
            
        }
        
        return sum;
    }

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