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

ll fastPow(ll a , ll b){
    if(b==0) return 1;
    ll x = fastPow(a , b/2);
    x = (x*x);
    if(b%2) x = x*a;
    return x;
}

ll solve(ll n){
    if(n==1) return 1;
    vector<pair<ll ,ll> > v;
    for(ll i=2;i*i<=n;++i){
        ll count = 0;
        while(n%i==0){
            ++count;
            n /= i;
        }
        if(count){
            v.push_back(make_pair(i , count));
        }
        
    }
    if(n>1) v.push_back(make_pair(n , 1));
    ll ans;
    if(v[0].second == 1) ans = v[0].first+1;
    else {ans = (fastPow(v[0].first , v[0].second-1)-1)/(v[0].first-1) + fastPow(v[0].first , v[0].second-1)*(v[0].first+1);}
    for(int i=1;i<v.size();++i){
        ll x = fastPow(v[i].first , v[i].second);
        ans *= x;
        ans += ((x-1)/(v[i].first - 1));
    }
    return ans;
}

int main(){
    int n;
    cin >> n;
    vector<ll> v(n);
    for(int i=0;i<n;++i) cin >> v[i];
    ll ans = 0;
    for(int i=0;i<n;++i){
        ans += solve(v[i]);
    }
    
    cout << ans<< endl;
}