#include <bits/stdc++.h>

using namespace std;

long preCalLimit = pow((long)10,(long)6);
vector<long>ret(preCalLimit,(long)0);
vector<long>primes;
void preCalculate(){
    for(int i=2;i<=preCalLimit;i++){
        bool isPrime  = true;
        for(int j = 2;j*j<=i;j++){
            if(i%j == 0){
                ret[i] = max(ret[i],1 + (j*(ret[(i/j)])));
                ret[i] = max(ret[i],1 + ((i/j)*(ret[j])));
                isPrime = false;
            }
        }
        if(isPrime){
            ret[i] = (long)1;
            primes.push_back((long)i);
        }
    }
}
long calLongVal(long val){
    long maxCurSeq = (long)0;
    bool isPrime = true;
    for(int i=0;i<primes.size();i++){
        long curPrime = primes[i];
        if(val % curPrime == (long)0){
            isPrime = false;
        }else{
            maxCurSeq = max(maxCurSeq,((long)1) + val + (curPrime*ret[(val/curPrime)]));
        }
    }
    return max((long)1,maxCurSeq);
}
long longestSequence(vector <long> a) {
    long ans = 0;
    for(int i=0;i<a.size();i++){
        long curVal = a[i];
        long curAns = 0;
        if(curVal<=preCalLimit){
            curAns = ret[curVal] + curVal;
        }else{
            curAns = calLongVal(curVal);
        }
        //cout<<curVal<<" "<<curAns<<endl;
        ans += curAns;
    }
    return ans;
}

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