#include <bits/stdc++.h>

using namespace std;
map<long,long>dp;
long longestSequence(long a) {
    //  Return the length of the longest possible sequence of moves.
    if(dp.find(a)!=dp.end())
        return dp.find(a)->second;
   
    int i=0,max=0,b;
    for(i=2;i<=a;i++){
        if(a%i==0){
      
           b=i*longestSequence(a/i);
            b++;
        if(max<b)
            max=b;
        }
    }
    dp[a]=max;
    return max;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    
   // cout<<dp[100000]<<endl;
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    //cout<<a.max_size()<<endl;
    long long result =0;
    
    int i=0;
    dp[1]=1;
    dp[0]=0;
    dp[2]=3;
    for(i=0;i<a.size();i++){
        result+= longestSequence(a[i]);
    }
    cout << result << endl;
    return 0;
}