#include <bits/stdc++.h>

using namespace std;
unordered_map <long long,long long > mapi;
long long findans(long long a) {
    if(a==1) {
        return 1;
    }
    if(a==2) {
        return 3;
    }
    if(mapi.find(a)!=mapi.end()) {
        return mapi[a];
    }
    long long k=a;   
    long long maxi=a+1;
        for(long long j=2;j<=sqrt(k);j++) {
            if(k%j==0) {
                long long df = k/j;
                maxi = max(maxi,1ll+max(df*findans(j),j*findans(df)));
            }
        }
    mapi[a] = maxi;
    return maxi;
}
long longestSequence(vector <long> a) {
  
    //  Return the length of the longest possible sequence of moves.
    long long ans=0ll;
    for(int i=0;i<a.size();i++) {
       
        ans+=findans(a[i]);
    }
    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];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}