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.
        long result=0;
        for(long num : a){
            ArrayList<Long> factors = decomposition(num);
            result+=calculateMove(factors);
        }
        return result;
    }
    public static ArrayList<Long> decomposition(long number){
        long n=number;
        ArrayList<Long> factors = new ArrayList<Long>();
        long a=2;
        while(a<=Math.pow(n,0.5)){
            while(n%a==0){
                factors.add(a);
                n=n/a;
            }
            a++;
        }
        if(n>1){
            factors.add(n);
        }
        return factors;
    }
    public static long calculateMove(ArrayList<Long> factors){
        Collections.reverse(factors);
        long move=1;
        long product=1;
        for(int i=0;i<factors.size();i++){            
            product*=factors.get(i);
            move+=product;
        }
        return move;
    }
    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();
    }
}