#include <bits/stdc++.h>

using namespace std;
bool prime(long n) {
if (n < 2) return false;
for (long x = 2; x*x <= n; x++) {
if (n%x == 0) return false;
}
return true;
}
vector<long> factors(long n) {
vector<long> f;
for (long x = 2; x*x <= n; x++) {
while (n%x == 0) {
f.push_back(x);
n /= x;
}
}
if (n > 1) f.push_back(n);
return f;
}
long longestSequence(vector <long> a) {
    long ans=0;
    //  Return the length of the longest possible sequence of moves.
    for(int i=0;i<a.size();i++)
    {
        long sum=0;
        if(a[i]==1){
            ans++;
            continue;
        }
        if(prime(a[i])){
            sum=a[i]+1;
        }
        else{
            
        
        vector<long> factor =factors(a[i]);
        for(long j=0;j<factor.size();j++)
        {
           sum=(sum+1)*factor[j];
        }
        sum++;
        }
        ans+=sum;
    }
   
    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;
}