#include <bits/stdc++.h>

using namespace std;

long long longestSequence(vector <long long> & a) {
    long long res = 0;
    for(auto & x : a)
    {
        long long here = x;
        for(long long z = 2; z * z <= x; ++z)
        { 
            while (x % z == 0)
            {
                x /= z;
                here += x;
            }
        }
        if (x > 1)
            here++;
        res += here;
    }
    return res;
}

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;
}