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

public class Solution {
    
    static boolean isPowerOf2(long n) {
        return (n & (n-1)) == 0;
    }
    
    static boolean isPrime(long n) {
        long sqrt = (long) Math.sqrt(n);
        for (long i = 2; i <= sqrt; i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }

    static long longestSequence(long[] a) {
        long total = 0;
        for (int i = 0; i < a.length; i++) {
            total += sequenceLength(a[i]);
        }
        return total;
    }
    
    static long sequenceLength(long n) {
        if (isPowerOf2(n)) {
            return (n * 2) - 1;
        }
        else {
            long sqrt = (long) Math.sqrt(n);
            // try getting the largest prime divisor first
            for (long i = 2; i <= sqrt; i++) {
                if (n % i == 0) {
                    long pair = n / i;
                    if (isPrime(pair)) { // if divisor pair is prime, pick that
                        return pair * sequenceLength(n / pair) + 1; // break into equal pieces
                    }
                }
            }
            // if nothing for the pair, then we go down from middle
            for (long i = sqrt; i > 1; i--) {
                if (n % i == 0) {
                    if (isPrime(i)) { // if divisor is odd, pick that
                        return i * sequenceLength(n / i) + 1; // break into equal pieces
                    }
                }
            }
            return n + 1; // reached prime number, break into sticks of length 1 and eat each one
        }
    }

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