#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define MAX 1000008
vector<int> SieveOfEratosthenes(int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    bool prime[n+1];
    memset(prime, true, sizeof(prime));
 
    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    vector<int> pr;
    for(int i=2;i<=n;i++){
        if(prime[i])
            pr.push_back(i);
    }
    return pr;
}

ll longestSequence(vector <ll> a) {
    //  Return the length of the longest possible sequence of moves.
    vector<int> pr=SieveOfEratosthenes(MAX);
    ll ans=0;
    for(int e=0;e<a.size();e++){
        ll v=a[e],t=a[e];
        for(int i=0;i<pr.size() && pr[i]*pr[i]<=t;i++){
            if(t==1)
                break;
            if(t%pr[i]==0){
                ll cof=t/pr[i];
                v+=cof;
                t=cof;
                i--;
            }
        }
        if(t!=1)
            v++;
        ans+=v;
    }
    return ans;
}

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