#include <bits/stdc++.h>

using namespace std;

#define ll long
#define pb push_back
#define vi vector<int>
#define vt vector<tup>
#define vtt vector<vt >
#define vii vector<vi >
#define viii vector<vii >
#define vb vector<bool>
#define vd vector<double>
#define vbb vector<vb >
#define vl vector<long long int>
#define vll vector<vl >
#define vlll vector<vll >
#define foi(x) for (int i = 0; i < x; ++i)
#define foj(x) for (int j = 0; j < x; ++j)
#define fok(x) for (int k = 0; k < x; ++k)
#define foi1(x) for (int i = 1; i <= x; ++i)
#define foj1(x) for (int j = 1; j <= x; ++j)
#define si size()
#define le length()
#define pp pair<ll,ll>

ll N = 10e6+5;

vl primes;

void genPrimes(){
    primes.pb(2);
    vb a(N, 1);
    for(int i=3;i<N;i+=2){
        if(a[i]){
            primes.pb(i);
            for(int k=2*i;k<N;k+=i)
                a[k]=0;
        }
    }
    return;    
}   

ll getVal(long a){
    int n = primes.si;
    ll ans = a;
    int i = 0;
    while(a>1 and i<n and a>=primes[i]){
        if(a%primes[i] == 0){
            while(a%primes[i]==0){
                ans+= (a/primes[i]) ;
                a /= primes[i];
            }
        }
        i++;
    }
    return ans;
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    ll ans=0;
    for(auto i:a)
        ans += getVal(i);
    return ans;
}

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