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

const long maxn = 1000000;
long f[maxn];
long cal(long x){
    if (f[x] != 0) return f[x];
    f[x] = x+1;
    for (int i = 2 ; i <= x/2 ; i++){
        if (x%i == 0) f[x] = max(f[x],(x/i)*cal(i)+1);
    }
    return f[x];
}
int main(){
    f[1] = 1;
    f[2] = 3;
    int n, tmp;
    long ans = 0;
    cin >> n;
    while (n-- != 0){
        cin >> tmp;
        ans += cal(tmp);
    }
    cout << ans;
    return 0;
}