#include <bits/stdc++.h>

using namespace std;

long long longestSequence(long long a, vector<long long> & primes) {
    vector<pair<long long, long long>> factors;
    for(int i = 0; i < primes.size() && primes[i] <= a; i++){
        if(a%primes[i] != 0) continue;
        factors.push_back(pair<long long,long long>(primes[i], 0));
        int ind = factors.size() - 1;
        while(a%primes[i] == 0){
            factors[ind].second++;
            a/=primes[i];
        }
    }
    if(a != 0 && a != 1){
        factors.push_back(pair<long long,long long>(a, 1));
    }
    long long ans = 1, product = 1;
    for(int i = factors.size() - 1; i >= 0; i--){
        //cout<<ans<<" "<<product<<endl;
        ans += product* factors[i].first *(pow(factors[i].first, factors[i].second) - 1) / (factors[i].first - 1);
        product *= pow(factors[i].first, factors[i].second);
    }
    return ans;
}

int main() {
    int n;
    cin >> n;
    vector<long long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    vector<long long> primes, ptrue(1000001, 1);
    for(int i = 2; i < 1000001; i++) {
        if(ptrue[i]) primes.push_back(i);
        for(int j = 0; i * j < 1000001; j++){
            ptrue[i*j] = 0;
        }
    }
    long long ans = 0;
    for(int i = 0; i < n; i++){
        long long result = longestSequence(a[i], primes);
        ans += result;
    }
    cout << ans << endl;
    
    return 0;
}