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

vector<ll> get(ll x){
    vector<ll> ret;
    while(x%2==0)ret.push_back(2),x/=2;
    ll i = 3;
    while(i * i <= x){
        while(x % i==0)x/=i,ret.push_back(i);
        i += 2;
    }
    if(x > 2)
         ret.push_back(x);
    return ret;
}

ll solve(ll x){
     ll ans = 1,mul = 1;
     vector<ll> divisors=get(x);
     sort(divisors.rbegin(),divisors.rend());
     for(int i = 0;i < divisors.size() ; i++)
         mul *= divisors[i],ans += mul;

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