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

public class Solution {
    
    static boolean isPrime(long n) {
    if(n < 2) return false;
    if(n == 2 || n == 3) return true;
    if(n%2 == 0 || n%3 == 0) return false;
    long sqrtN = (long)Math.sqrt(n)+1;
    for(long i = 6L; i <= sqrtN; i += 6) {
        if(n%(i-1) == 0 || n%(i+1) == 0) return false;
    }
    return true;
    }
    
    static long gpf(long numbers) {
        long n = numbers;
        List<Long> factors = new ArrayList<Long>();
        for (long i = 2; i <= n / i; i++) {
            while (n % i == 0) {
                if(!factors.contains(i))
                factors.add(i);
                n /= i;
            }
        }
        if (n > 1) {
        	if(!factors.contains(n))
            factors.add(n);
        }
        return Collections.max(factors);
    }
    
    static long longestSequence(long N) {
        if(N==1)
            return 1;
        long totalMoves = 1 + N;
        long n = N;
        long move = 1;
        while(!isPrime(n)){
            move = move*gpf(n);
            n = n/gpf(n);
            totalMoves = totalMoves + move;
        }
        return totalMoves;
    }
    
    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 = 0;
        for(int i=0;i<n;i++){
            result = result + longestSequence(a[i]);
        }
        System.out.println(result);
        in.close();
    }
}