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

int main() {  
    int T; cin >> T;
    ll ans = 0;
    while(T--){
        ll n; cin >> n;
        vector<ll> primes;
        for(ll x=2; x*x<=n; x++){
            while(n%x==0)n/=x, primes.push_back(x);
        }
        if(n>1)primes.push_back(n);
        ll last=1;
        for(int x=int(primes.size())-1; x>=0; x--){
            ans += last;
            last *= primes[x];
        }
        ans += last;
    }
    cout << ans << "\n";
}