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

public class Solution {
    
    boolean[] prime;
    long[] moves;
    
    int isprime(long num) {
        int n=1000000;
        if(prime==null){
          prime = new boolean[1000000+1];
        for(int i=0;i<n;i++)
            prime[i] = true;
         
        for(int p = 2; p*p <=n; p++)
        {
            // If prime[p] is not changed, then it is a prime
            if(prime[p] == true)
            {
                // Update all multiples of p
                for(int i = p*2; i <= n; i += p)
                    prime[i] = false;
            }
           }           
        }
        
        if(num>1000000)
            return -1;
        return prime[(int)num]?1:0;
    }
    
    long getNextPrime(long num) {
        long i=num+1;
        while(!prime[(int)i])
            i++;
        return i;
    }
    
    long getMoves(long a) {
        if(a==1)
            return 1;
        if(isprime(a)==1)
            return a+1;
        long moves=a;
        long prime=2;
        while(a!=1) {
            while(a%prime==0){
                moves+=(a/2);
                a=a/2;
            }
            prime=getNextPrime(prime);
        }
        return moves;
    }

    long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long totalMoves=0;
        for(int i=0;i<a.length;i++) {
            totalMoves+=getMoves(a[i]);
        }
        return totalMoves;
    }

    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();
        }
        Solution sol=new Solution();
        long result = sol.longestSequence(a);
        System.out.println(result);
        in.close();
    }
}