#include <bits/stdc++.h>
using namespace std;
#define MOD 2000000011
#define pb push_back
#define xx first
#define yy second
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define repp(i,k,n) for(int i=k;i<n;i++)
typedef unsigned long long ll;
typedef vector<int> iv;
typedef pair<int,int> iip;
typedef map<int,int> mii;
typedef vector<vector<int> > vvi;
typedef vector<vector<ll> > vvll;
template <typename T>
void dbg(T t){cerr<<t<<endl ;}
template<typename T, typename... Args>
void dbg(T t, Args... args) {cerr << t <<" ";dbg(args...) ;}
vector<ll> primes;

ll longestSequence(ll a){
    int i = 0;
    vector<ll> v;
    while (!(a % 2)) {
        a >>= 1; 
        v.pb(2);
    }
    for (ll i = 3; i <= sqrt(a); i += 2) {
        while (a % i == 0) {
            a = a / i;
            v.pb(i);
        }
    }
 
    if (a > 2) v.pb(a);
    //cout << v.size();
    ll d = 1;
    ll ans = 0;
    for(i = v.size() - 1;i >= 0;i--){
        ans += d;
        d*= v[i];

    }
    ans += d;
    return ans;
}

int main() {
    ios::sync_with_stdio(0);cin.tie(0);
    int n;
    ll ans = 0,a;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a;
        ans += longestSequence(a);
    }
  
    cout << ans << endl;
    return 0;
}