#include <bits/stdc++.h>

using namespace std;

vector<long> factorization(long n) {
    vector<long> result;
    for (long i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            while (n % i == 0) {
                n /= i;
                result.push_back(i);
            }
        }
    }
    if (n > 1) {
        result.push_back(n);
    }
    return result;
}

long longestSequence(vector <long> a) {
    long result = 0;
    for(int i=0; i<a.size(); i++){
        if(a[i]==1){
            result += 1;
            continue;
        }
        vector<long> fac = factorization(a[i]);
        long part = 0;
        for(int j=0; j<fac.size(); j++){
            part = (part + 1)*fac[j];
        }
        result += part + 1;
    }
    return result;
}

int main() {
    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;
}