#include <iostream>
#include <vector>
#include <cassert>
using namespace std;

typedef long long ll;

vector<ll> factors(ll n) {
    vector<ll> f;
    for(ll i=2;i*i<=n;i++) {
        while(!(n%i)) {
            f.push_back(i);
            n /= i;
        }
    }
    if(n != 1) f.push_back(n);
    return f;
}


ll go(ll n) {
    if(n == 1) return 1;
    vector<ll> f = factors(n);
    assert(f.size());
    ll ans = f[0]+1;
    for(int i=1;i<f.size();i++) {
        ans = ans*f[i]+1;
    }
    return ans;
}

int main() {
    int n; cin >> n;
    ll ans = 0;
    for(int i=0;i<n;i++) {
        ll x; cin >> x;
        ans += go(x);
    }
    cout << ans;
}