#include <bits/stdc++.h>
using namespace std;
#define ll long long int
vector<ll> primes;
ll ar[1000006],ans;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    ll k,cnt;
    for(ll i=0;i<a.size();i++) {
        vector<ll> cur;
        k = a[i];
        for(ll j=0;j<primes.size();j++) {
            while(k%primes[j]==0) {
                cur.push_back(primes[j]);
                k /= primes[j];
            }
        }
        if(k>1)
            cur.push_back(k);
        cnt = 1;
        ans += 1;
        for(ll j=cur.size()-1;j>=0;j--) {
            cnt *= cur[j];
            ans += cnt;
        }
    }
    return ans;
}

int main() {
    int n;
    for(ll i=2;i<1000001;i++)
        if(!ar[i]) {
            primes.push_back(i);
            for(ll j=i;j<1000001;j+=i)
                ar[j] = 1;
        }
    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;
}