#include <bits/stdc++.h>

using namespace std;

long long longestSequence(vector <long long> a) {
    long long ret = 0;
    for (int i = 0; i < a.size(); i++) {
        long long x = a[i];
        long long z = (long long) sqrt(x);
        long long div = 2;
        vector<long long> facs;
        while ((div <= z) && (x > 1)) {
            if (x % div) {
                div++;
            } else {
                facs.push_back(div);
                x /= div;
            }
        }
        if (x > 1) {
            facs.push_back(x);
        }
        
        long long move = a[i];
        if (facs.size()) {
            long long x = 1;
            for (int j = facs.size() - 1; j >= 0; j--) {
                move += x;
                x *= facs[j];
            }
        }
        ret += move;
    }
    
    return ret;
}

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