#include <bits/stdc++.h>

#define MOD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define ll long long
#define INF 1000000000000000000ll

using namespace std;

ll a[1000005] = {0},res = 0;

ll solve(ll n){
    long long res = 0;
    if(n <= 1000000ll) return a[n];
    for(ll i = 2; i * i <= n; i ++){
        if(n % i == 0){
            res = max(res, 1 + i * solve(n / i));
            res = max(res, 1 + (n / i) * solve(i));
        }
    }
    return res;
}

int main() {
    a[1] = 1;
    for(int i = 2; i <= 100000; i ++){
        a[i] = i + 1;
        for(int j = 2; j * j <= i; j ++){
            if(i % j == 0){
                a[i] = max(1 + j * a[i / j],a[i]);
                a[i] = max(1 + (i/j) * a[j],a[i]);
            }
        }
    }
    int t;
    cin>>t;
    while(t--){
        ll n;
        cin>>n;
        res += solve(n);
    }
    cout<<res;
    return 0;
}