#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    long ans = 0;
    for (int i=0;i<a.size();++i) {
        long x = a[i], tans = 0, pow = 1;
        vector<long> div;
        for (long d=2;d*d<=x;++d) {
            if (!(x%d)) {
                div.push_back(d);
                while (!(x%d)) {
                    x /=d;
                }
            }
        }
        if (x>1) {
            div.push_back(x);
        }
        x = a[i];
        while (!div.empty()) {
            long d = div.back();
            div.pop_back();
            while (!(x%d)) {
                tans += pow;
                pow *= d;
                x /= d;
            }
        }
        tans += a[i];
        ans += tans;
    }
    return ans;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}