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 total = 0;
        boolean found = false;
        for (long stick : a) {
            if (stick == 1) {
                total++;
            }
            else {
                total += stick;
                int i = 0;
                for (i = 2; i <= Math.sqrt(stick); i++) {
                    if (stick == 1) {
                        total++;
                        found = true;
                        break;
                    }
                    else {
                        if (stick % i == 0) {
                            stick = stick / i;
                            total += stick;
                            i = 1;
                        }
                    }
                }
                if (i > Math.sqrt(stick)) {
                    total++;
                }
            }
        }
        return total;
    }

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