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

typedef long long int ll;

const int LIM = 1e6 + 5;
int d[LIM];

void _build() {
    memset(d, 0, sizeof d);
    d[0] = 0;
    d[1] = 1;
    for(int i = 1;i < LIM;i++) {
        for(int j = 2;j*i < LIM;j++) {
            int el = i*j;
            d[el] = max(d[el], 1 + j*d[i]);
        }
    }
}

ll moves(ll x) {
    if(x == 1) return 1;
    
    if(x < LIM) return d[x];
    
    ll ret = 1+x;
    for(ll i = 2;i < sqrt(x);i++) {
        if(x%i == 0) {
            ll u = moves(x/i);
            ll tmp = 1 + max(d[i]*(x/i), u*i);
            ret = max(ret, tmp);
        }
    }
    return ret;
}

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