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

public class Solution {

static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        // Find Factors
        int size = 1000001;
        boolean[] isPrime = new boolean[size];
        List<Integer> primeList = new ArrayList<Integer>();
        for(int i=0;i<size;i++){
            isPrime[i] = true;
        }
        isPrime[0]=isPrime[1]=false;
        for(int i=2;i<size;i++){
            if(isPrime[i] == false)continue;
            for(int j=2*i;j<size;j+=i){
                isPrime[j] = false;
            }
        }
        
        for(int i=2;i<size;i++){
            if(isPrime[i]){
                primeList.add(i);
            }
        }
        
        long total = 0;
        for(int i=0;i<a.length;i++){
            long num = a[i];
            List<Long> factor = new ArrayList<Long>();
            List<Integer> count = new ArrayList<Integer>();
            for(int j=0;j<primeList.size();j++){
                int c = 0;
                
                while(num%primeList.get(j) == 0){
                    num/=primeList.get(j);
                    c++;
                }
                
                if(c>0){
                    factor.add(0l+primeList.get(j));
                    count.add(c);
                }
            }
            
            if(num > 1000000){
                factor.add(num);
                count.add(1);
            }
            
            long parts = 1;
            long onePartSize = a[i];
            for(int j=factor.size()-1;j>=0;j--){
                for(int k=0;k<count.get(j);k++){
                    total += parts;
                    parts *= factor.get(j);
                    onePartSize /= factor.get(j); 
                }
            }
            total += parts;
        }
        
        return total;
    }

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