#include <iostream>
#include <vector>

using namespace std;

int main() {
    vector <int> p;
    vector <bool> prime(1000001, true);
    for (int i = 2; i <= 1e6; i++)
        if (prime[i]) {
            p.push_back(i);
            for (int j = 2 * i; j <= 1e6; j += i)
                prime[j] = false;
        }
    int t; cin >> t;
    long long res = 0;
    while (t--) {
        res++;
        long long n; cin >> n;
        for (int i = 0; i < p.size() && p[i] * p[i] <= n; i++)
            while (n % p[i] == 0)
                res += n, n /= p[i];
        if (n > 1) res += n;
    }
    cout << res;
}