#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

vector<ll> nums(1000001, 1), prime;

void seive(){
    for(ll i=2; i<=1000001; i++){
        if(nums[i] == 1){
            prime.push_back(i);
            for(ll j=2*i; j<=1000001; j+=i){
                nums[j] = 0;
            }
        }
    }
}

ll count(ll a){
    if(a == 1){
        return 1;
    }
    int l = prime.size();
    int num = 0;
    for(int i=l-1; i>=0; i--){
        if(a%prime[i] == 0){
            a /= prime[i];
            num = prime[i];
            break;
        }
    }
    if(num==0){
        return a+1;
    }
    return num*count(a)+1;
}

ll cut(ll a){
    int l = prime.size();
    ll b = a;
    for(int i=0 ;i<l; i++){
        while(a%prime[i] == 0){
            a /= prime[i];
        }
    }
    if(a==1){
        return count(b);
    }
    return a*count(b/a)+1;
}

ll longestSequence(vector <ll>& a) {
    int n = a.size();
    ll sum = 0;
    for(int i=0; i<n; i++){
        sum += cut(a[i]);
    }
    return sum;
}

int main() {
    seive();
    int n;
    cin >> n;
    vector<ll> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    ll result = longestSequence(a);
    cout << result << endl;
    return 0;
}