#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

ll arrprimes[1000001]={0};
vector<ll> primes;

void sieve(int n)
{
    arrprimes[1]=1;
    arrprimes[0]=1;
    for(int i=2;i<=n;i++)
    {
        if(!arrprimes[i])
        {
            primes.push_back(i);
            for(int j=i*2;j<=n;j+=i)
                arrprimes[j]=1;
        }
    }
}

int main() {  
    int n;
    sieve(1000000);
    cin >> n;
    vector <ll> a(n);
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        ll s = a[i];
        ll rev = 1;
        ll cnt = s;
        for(int i=0;i<primes.size();i++){
            while(s%primes[i]==0){
                ans+= cnt;
                cnt /= primes[i];
                s /= primes[i];
            }
        }
        if(s!=1){
            ans += s;
        }
        ans++;
    }
    cout<< ans;
    
    return 0;
}