import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Solution {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BreakingSticks solver = new BreakingSticks();
        solver.solve(1, in, out);
        out.close();
    }

    static class BreakingSticks {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] primes = Utils.generatePrimes(1234567);
            long answer = 0;
            for (int i = 0; i < n; i++) {
                long x = in.nextLong();
                answer += x;
                while (x > 1) {
                    boolean changeDone = false;
                    for (int prime : primes) {
                        while (x % prime == 0) {
                            changeDone = true;
                            answer += x / prime;
                            x /= prime;
                        }
                    }
                    if (!changeDone) {
                        x = 1;
                        answer++;
                    }
                }
            }
            out.println(answer);
        }

    }

    static class InputReader {
        private StringTokenizer tokenizer;
        private BufferedReader reader;

        public InputReader(InputStream inputStream) {
            reader = new BufferedReader(new InputStreamReader(inputStream));
        }

        private void fillTokenizer() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (Exception e) {
                    throw new RuntimeException(e);
                }
            }
        }

        public String next() {
            fillTokenizer();
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }

    static class Utils {
        public static int[] generatePrimes(int maxValue) {
            boolean[] isPrime = new boolean[1234567];
            ArrayList<Integer> primes = new ArrayList<>();
            Arrays.fill(isPrime, true);
            isPrime[0] = isPrime[1] = false;
            for (int i = 2; i < 1234567; i++) {
                if (isPrime[i]) {
                    primes.add(i);
                    for (long j = (long) i * i; j < 1234567; j += i) {
                        isPrime[(int) j] = false;
                    }
                }
            }
            int[] answer = new int[primes.size()];
            for (int i = 0; i < primes.size(); i++) {
                answer[i] = primes.get(i);
            }
            return answer;
        }

    }
}