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

map<ll, ll> Map;

ll solve(ll a){
    if(a == 1)
        return 1LL;
    if(Map[a] != 0)
        return Map[a];
    ll Max = a;
    for(int i = 2; i*i <= a; i++){
        if(a % i == 0){
            Max = max(Max, i * solve(a / i));
            Max = max(Max, a / i * solve(i));
        }
    }
    return Map[a] = Max + 1;
}

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