#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll a2[1000005];

int main(void) {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n;
    cin >> n;
    vector<ll> q;
    while (n--) {
        ll a;
        cin >> a;
        q.push_back(a);
    }

    for (ll i = 1; i < 1000005LL; i++) {
        ++a2[i];
        for (ll j = i; j < 1000005LL; j += i) {
            a2[j] = max(a2[j], a2[i] * (j / i));
        }
    }

    ll ans = 0;
    for(auto p :q) {
        ll el = p;
        if(p < 1000005LL) {
            ans += a2[p];
            continue;
        }
        
        vector<ll> fac;
        for(ll i = 2; i < 1000001LL; i++) {
            while(el % i == 0) {
                el /= i;
                fac.push_back(i);
            }
        }

        fac.push_back(el);
        sort(fac.begin(), fac.end());
        ll mult = 1;
        while(fac.size() != 0) {
            ans += mult;
            mult *= fac[fac.size()-1];
            if(p/mult < 1000005LL) {
                ans += mult*a2[p/mult];
                fac.clear();
            }

            if(!fac.empty())
                fac.pop_back();
        }
    }

    cout << ans << '\n';
}