#include <bits/stdc++.h>

using namespace std;
long largestPrimeFactor(long n){
    long maxPrime = -1;
    while (n % 2 == 0) {
        maxPrime = 2;
        n >>= 1;
    }
    for (int i = 3; i <= sqrt(n); i += 2) {
        while (n % i == 0) {
            maxPrime = i;
            n = n / i;
        }
    }
    if (n > 2)
        maxPrime = n;
    return maxPrime;
}
long longestSequence(vector <long> a) {
    long ans = 0;
    for(long i = 0;i < a.size();i++){
        long c = 1;
        ans += 1;
        while(a[i]!=1){
            long l = largestPrimeFactor(a[i]);
            c *= l;
            ans += c;
            a[i] = a[i]/l;
        }
    }
    return ans;
}

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;
}