#include <bits/stdc++.h>
#define pb push_back
using namespace std;


bool primes[1000004] = {0};
long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    
    vector<int> pr;
    for(int i=2;i<1000004;i++)
    {
        if(!primes[i])
        {
            pr.pb(i);
            for(int j=i+i;j<1000004;j+=i)
            {
                primes[j] =1;
            }
        }
    }
    long ans = 0 ;
    for(int i=0;i<a.size();i++)
    {
        long x = a[i];
        for(int j=0;j<pr.size();j++)
        {
            long d = pr[j];
            while(x%d == 0)
            {
                ans += x;
                x /= d;
            }
        }
        if(x != 1)ans += x;
        ans++;
    }
    
    return ans ;
        
}

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