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

vector<long long> divisor;
map<long long, long long> dp;

void getDiv(long long x)
{
    divisor.clear();
    
    for(long long i=2; i*i <= x; i++) {
        if(x % i == 0)
        {
            divisor.push_back(i);
            
            if(i * i != x)
                divisor.push_back(x/i);
        }
    }
}

long long solve(long long N) {
    
    if(N == 1)
        return 1;
    
    if(dp.count(N)) {
        return dp[N];
    }
    
    long long ans = N + 1;
    
    for(long long i=0; i<divisor.size(); i++)
        if(N % divisor[i] == 0)
            ans = max(ans, solve(N/divisor[i]) * divisor[i] + 1);
    
    return dp[N] = ans;
}

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