#include <bits/stdc++.h>

using namespace std;

bool flag[1000005];
vector<long> prime;

long factorize(long a) {
    long total = a;
    //cout<<a<<endl;
    int idx = 0;
    
    while (a > 1 && idx < prime.size() && prime[idx] * prime[idx] <= a) {
        while (a % prime[idx] == 0) {
            a /= prime[idx];
            //cout<<a<<endl;
            total += a;
        }
        ++idx;
    }
    
    if (a > 1) {
        total += 1;
        //cout<<1<<endl;
    }
    return total;
}

long longestSequence(vector <long> a) {
    long total = 0;
    for (int i=0;i<a.size();++i) {
        total += factorize(a[i]);
    }
    return total;
}

int main() {
    memset(flag,0,sizeof(flag));
    for (long i=2;i<=1000000;++i) {
        if (flag[i]) continue;
        prime.push_back(i);
        for (long j=i*i;j<=1000000;j+=i) flag[j] = true;
    }
    
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}