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

public class Solution {
    static boolean isPrime(long n)
    {
        //check if n is a multiple of 2
        if (n%2==0) return false;
        //if not, then just check the odds
        for(long i=3;i*i<=n;i+=2) {
            if(n%i==0)
                return false;
        }
        return true;
    }
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long sum=0;
        long temp=0;
        long iter =3;
        for(int i=0;i<a.length;i++)
        {
            while(a[i]%2==0)
            {
                temp+=a[i];
                a[i]/=2;
                //System.out.println(temp);
            }
            while(a[i]!=1)
            {
                /*if(isPrime(a[i]))
                {
                    temp+=a[i];
                    //System.out.println(temp);
                    break;
                }
                else*/
                {   
                    if(a[i]%iter==0)
                    {
                        temp+=a[i];                        
                        a[i]/=iter;   
                        
                    }
                    else
                    {
                        iter+=2;
                        if(iter>(long)Math.sqrt(a[i]))
                        {
                            temp+=a[i];
                            break;
                        }
                        //
                        
                    }
                }
            }
            sum+=temp+1;
            //System.out.println(temp+1);
            iter =3;
            temp=0;
        }
        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();
    }
}