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

public class Solution {

    static long longestSequence(long[] a) {
        List<Integer> primes = primeNumbers(1000000);
        long output = 0;
        for (long number : a) {
            long result = 1;
            while (number > 1) {
                boolean isPrime = true;
                result += number;
                for (Integer prime : primes) {
                    if (number % prime == 0) {
                        isPrime = false;
                        number /= prime;
                        break;
                    }
                }
                if (isPrime) number = 1;
            }
            output += result;
        }
        return output;
    }
    
    private static List<Integer> primeNumbers(int n) {
        boolean[] hasFactor = new boolean[n+1];
        for (int i = 3; i <= Math.sqrt(n); i+=2) {
            if (!hasFactor[i])
                for (int k = i*3; k < hasFactor.length; k += i+i)
                    hasFactor[k] = true;
        }
        List<Integer> output = new ArrayList<>();
        output.add(2);
        for (int i = 3; i < hasFactor.length; i+=2) {
            if (!hasFactor[i]) output.add(i);
        }
        return output;
    }

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