#include <bits/stdc++.h>

using namespace std;
int* dp;
long my_func(int n){
    if(n==1)
        return 0;
    if(dp[n])
        return dp[n];
    int i;
    int64_t sol=0;
    for(i=1;i<n;i++)
        if(n%i==0){
            //cout<<i<<" "<<n<<endl;
            int64_t temp=1 + (n/i)*my_func(i);
            if(temp>sol)
                sol=temp;
        }
    dp[n]=sol;
    return sol;
}
long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long sol=0;
    for(int i=0;i<a.size();i++){
        sol+=my_func(a[i])+a[i];
        //cout<<my_func(a[i])<<endl;
    }
    return sol;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    int mark=0;
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
        if(a[a_i]>mark)
            mark=a[a_i];
    }
    dp=(int*)calloc(sizeof(int),mark+1);
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}