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

public class Solution {
static HashMap<String,Long> dp=new HashMap<String,Long>();
    static{dp.put("1",Long.parseLong("1"));
    dp.put("2",Long.parseLong("3"));}
    
    static long longestSequence(long[] a) {
        long answer=0;
        for(int i=0;i<a.length;i++)
        {
           
                long t=divideIt(a[i]);
             
            answer+=t;
            //System.out.println(t);
        }
        return answer;
        //  Return the length of the longest possible sequence of moves.
    }
    static long divideIt(long k)
    {
       if(k==0){return 0;}
       if(k==1){return 1;}
        if(k==2){return 3;}
        
        
        if(dp.get(k+"")!=null)//got stored
        {
            return dp.get(k+"");
        }
        else//new 
        {
            if(k%2==0)
            {
                List<Long> li=new ArrayList<Long>();
                    for (long i=1; i<=Math.sqrt(k)+1; i++)
                    {
                        if (k%i==0)
                        {
                            // If divisors are equal, print only one
                           // if (n/i == i)
                                //System.out.printf("%d ", i);
                             li.add(i);   

                           // else // Otherwise print both
                                //System.out.printf("%d %d ", i, n/i);
                        }
                    }
                long max=0;
                for(int i=0;i<li.size();i++)
                {
                    long now=li.get(i);
                    long other=k/now;
                    if(now==1)
                    {
                        long val=other;
                        if(max<val){max=val;}
                    }
                    else
                    {
                        long val1=other*divideIt(now);
                        long val2=now*divideIt(other);
                        if(val1<val2){val1=val2;}
                        if(val1>max){max=val1;}
                    }
                    
                }
                long lis=max+1;
                dp.put(k+"",lis);
                return lis;
                
                

            }
            else
            {
                long ans=1+k;
                dp.put(k+"",ans);
                return ans;
            }
            
            
        }
        
    }

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