#include <bits/stdc++.h>

using namespace std;

long long ans(long long n)
{
    long long int ans = n;
    long long int factor=3, maxFactor=sqrt(n);

    while(n%2==0){
        ans += n/2;
        n/=2;
    }

    while (factor <= maxFactor && n >1) {
        if(n%factor==0) {
            ans += n/factor;
            n/=factor;
            while(n%factor==0) {
                ans += n/factor;
                n/=factor;
            }
            maxFactor=sqrt(n);
        }
        factor+=2;
    }
    if (n>1) ans++;
    return ans;
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long long total = 0;
    for(int i = 0; i < a.size(); i++)
    {
        total += ans(a[i]);
    }
    return total;
}

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