#include <bits/stdc++.h>

using namespace std;

uint64_t longestSequence(vector <uint64_t> a) {
    uint64_t res = 0;
    for (int i = 0; i < a.size(); i++) {
        uint64_t num = a[i];
        res += a[i];
        //cout << "1: " << a[i] << " " << res << endl;
        while (num%2 == 0) {
            num /= 2;
            res+=num;
        }
        //cout << "2: " << a[i] << " " << res << endl;
        uint64_t lim = ((uint64_t) (sqrt(num))+5);
        for (uint64_t fac = 3; fac <= lim && num >= fac; fac+=2) {
            while (num%fac == 0)             {
                num/=fac;
                res+=num;
            }
        }
        //cout << "3: " << a[i] << " " << res << endl;
        if (num > 1) res+=1;
        //cout << "4: " << a[i] << " " << res << endl;
    }
    return res;
}

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