#include <bits/stdc++.h>

using namespace std;

unsigned long moves_for_stick_of_length(unsigned long N)
{
    //cout << "Considering stick of length " << N << endl;
    //cout << "Getting primes" << endl;

    vector<unsigned long> primes;
    unsigned long divisor = 2;
    unsigned long N_orig = N;

    if (N == 1) {
        primes.push_back(1);

        unsigned long moves = 1;
        //cout << "Number of moves for this chocolate stick: " << moves << endl;
        return moves;
    } else {

        while(true) {
            if (N == divisor) {
                primes.push_back(divisor);
                //cout << "found last prime " << divisor << endl;
                break;
            } else if ((N%divisor) == 0) {
                primes.push_back(divisor);
                //cout << "found prime " << divisor << endl;
                N /= divisor;
                //cout << "N is now " << N << endl;
            } else {

                if (divisor*divisor > N) {
                    divisor = N;
                } else {
                    divisor++;
                }
                //cout << "incrementing divisor" << endl;

            }
        }
    }

    /*
    cout << "Primes: ";
    for (int ii=0; ii<primes.size(); ii++) {
        cout << primes[ii] << " ";
    }
    cout << endl;
    */

    // revert primes
    vector<unsigned long> primes_sorted(primes.size());
    for (int ii=0; ii<primes.size(); ii++) {
        //primes_sorted.push_back( primes[primes.size() - 1 - ii] );
        primes_sorted[ii] = primes[primes.size() - 1 - ii];
    }

    /*
    cout << "Primes sorted: ";
    for (int ii=0; ii<primes_sorted.size(); ii++) {
        cout << primes_sorted[ii] << " ";
    }
    cout << endl;
    */


    unsigned long a = 1;
    unsigned long moves = a;
    for (int ii=0; ii<primes_sorted.size(); ii++) {
        a *= primes_sorted[ii];
        moves += a;
    }

    //cout << "Number of moves for this chocolate stick: " << moves << endl;
    return moves;
}

unsigned long longestSequence(vector <unsigned long> a) {
    //  Return the length of the longest possible sequence of moves.

    int n = a.size();
    unsigned long total_moves = 0;

    for (int original_sticks=0; original_sticks<n; original_sticks++) {
        total_moves += moves_for_stick_of_length(a[original_sticks]);
    }

    return total_moves;
}

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