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

public class Solution {

    static long longestSequence(long[] a) {
        long sum = 0;
        for (long value : a) {
           sum = sum + getLongestSequence(value);
        }
        return sum;
    }

    static long getLongestSequence(long a) {
        if (a == 1) {
            return 1;
        }

        long sum = a;
        long heighestMultiplier = getHeighestMultiplier(a);
        while (heighestMultiplier > 1) {
            sum = sum + heighestMultiplier;
            heighestMultiplier = getHeighestMultiplier(heighestMultiplier);
        }
        sum = sum + heighestMultiplier;
        return sum;
    }

    static long getHeighestMultiplier(long a) {
        if (a == 2) {
            return 1;
        }
        for (long i = 2 ; i <= (long) (Math.sqrt(a)+1) ; i++) {
            if (a%i == 0) {
                return Math.max(i, a/i);
            }
        }
        return 1;
    }

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