#include <bits/stdc++.h>

using namespace std;

long longestSequence(long A, const vector<int>& primes) {
    long res = A;
    vector<long> factors;
    for(int i=0; i<primes.size(); ++i) {
        long p = primes[i];
        while (A%p == 0) {
            factors.push_back(p);
            A /= p;
        }
        if (A == 1) break;
    }
    if (A != 1) {
        factors.push_back(A);
    }
    long num_pieces = 1;
    for(int i=factors.size()-1; i>=0; --i) {
        res += num_pieces;
        num_pieces *= factors[i];
    }
    return res;
}

long longestSequence(vector<long> a) {
    int K=1000000;
    vector<bool> primes_arr(K, true);
    int num_primes = 0;
    for(int i=2; i<K; ++i) {
        if (primes_arr[i]) {
            for(int j=2*i; j<K; j+=i) {
                primes_arr[j] = false;
            }
            ++num_primes;
        }
    }
    vector<int> primes(num_primes, 0);
    num_primes = 0;
    for(int i=2; i<K; ++i) {
        if (primes_arr[i]) {
            primes[num_primes++] = i;
        }
    }
    long res = 0;
    for(int i=0; i<a.size(); ++i) {
        res += longestSequence(a[i], primes);
    }
    return res;
}

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