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

public class Solution {

    static long[] primes = new long[10000];
    static long longestSequence(long[] a) {
       int sum =1;
        init();
       for(int i=0; i<a.length; i++){
           sum += util(a[i]);
       }
       return sum+1;
    }
    
    static void init(){
        int index = 2;
        primes[0] = 2;
        primes[1] = 3;
        int num=5;
        while(index < primes.length){
            if(isPrime(num)){
                primes[index] = num;
                
                index++;
            }
            num = num+2;
        }
    }
    static Boolean isPrime(long n){
        if(n==2){return true;}
        if(n%2 ==0){return false;}
        long t = 3;
        while(t*t<=n){
            if(n%t == 0){
                return false;
            }
            t=t+2;
        }
        return true;
    }

    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();
    }
    static long util(long n){
        if(n==1){
            return 1;
        }else if(isPrime(n)){
            return n;
        }
        else{
            //find the highest prime factor of n;
            long highestSoFar = 1;
            for(int i=0; primes[i]*primes[i]<=n;i++){
                //System.out.println("primes["+i+"]= "+primes[i]);
                 //System.out.println("n="+n);
                if(n%primes[i]==0){
                    highestSoFar = primes[i];
                     //System.out.println("pranav :"+highestSoFar);
                }
            }
            //System.out.println("n="+n+" highestSoFar"+highestSoFar);
            //System.out.println("n/highestSoFar="+n/highestSoFar);
            return  highestSoFar + highestSoFar*(util(n/highestSoFar));
        }
        //return 0;
    }
}