#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1000000;
vector<int> primes;
typedef long long ll;
void sieve(){
    vector<int> is_prime(MAXN+1,1);
    for(int i=2;i*i<=MAXN;i++){
        if(is_prime[i]){
            for(int j = i*i ; j <= MAXN; j+= i){
               is_prime[j] = 0;
            }
        }
    }
    for(int i=2;i<MAXN;i++){
        if(is_prime[i]){
          primes.push_back(i);
        }
    }
}

vector<ll> get_primes(ll x){
    vector<ll> ans;
    for(int i=0;i<primes.size();i++){
        if(x % primes[i] == 0){
            ans.push_back(primes[i]);
            while(x % primes[i] == 0){
                x /= primes[i];
            }
        }
    }
    if(x > 1){
        ans.push_back(x);
    }
    return ans;
}
map<ll,ll> memo;

ll solve_dp(ll x , const vector<ll> & x_primes){
    if(x == 1){
        return 1;
    }
    ll & ret = memo[x];
    if(ret != 0){
        return ret;
    }
    for(int i=0;i<x_primes.size();i++){
        if(x % x_primes[i] == 0){
            ret = max(ret , solve_dp(x/x_primes[i], x_primes) * x_primes[i] + 1   );
        }
    }
    return ret;
}

ll solve(ll x){
    vector<ll> x_primes = get_primes(x);
    return solve_dp(x, x_primes);
}

ll longestSequence(vector <ll> a) {
    sieve();
    ll res = 0;
    for(int i=0;i<a.size();i++){
        res += solve(a[i]);
    }
    return res;
}

int main() {
    int n;
    cin >> n;
    vector<ll> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    ll result = longestSequence(a);
    cout << result << endl;
    return 0;
}