#include <bits/stdc++.h>

using namespace std;
long factorize(long x){
    long sol=x;
    long r=2;
    while(x!=1){
        if(x%r==0){
            x/=r;
            sol+=x;
        }
        else r++;
    }
    return sol;
}
long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long rez=0;
    for(int i=0;i<a.size();i++){
        rez+=factorize(a[i]);
    }
    return rez;
}

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