#include <bits/stdc++.h>

using namespace std;

vector<long> primes = {2,3,5,7};

long long solve_piece ( long in ) {
    if ( in == 1) return 1;
    long long ans = 1;
    vector<long> pfac;
    long temp = in;
    for ( int j = 0; primes[j]*primes[j] <= in && j < primes.size(); ++j ) {
        while ( temp % primes[j] == 0 ) {
            temp /= primes[j];
            pfac.push_back(primes[j]);
        }
    }
    if ( temp > 1 ) {
        pfac.push_back(temp);
    }
    
    for ( int i = 0; i < pfac.size(); ++i ) {
        ans = ans*pfac[i];
        ans++;
    }
    return ans;
}


int main() {
    for ( long i = 12; i < 1e6+1; i+=6 ) {
        vector<long> cands = {i-1, i+1};
        for ( auto c: cands ) {
            bool good = true;
            for ( int j = 0; primes[j] * primes[j] <= c; ++j ) {
                if ( c % primes[j] == 0 ) {
                    good= false;
                    break;
                }
            }
            if ( good ) {
                primes.push_back(c);
            }
        }
        
    }
    int n;
    cin >> n;

    long long res = 0;
    for(int a_i = 0; a_i < n; a_i++){
       long a;
        cin >> a;
        res += solve_piece(a);
    }
    cout << res << endl;
    return 0;
}