#include <bits/stdc++.h>
typedef long long int lli;
using namespace std;

long longestSequence(vector <long> a) {
   lli n=a.size(),ans=0,i;
    for(i=0;i<n;i++)
    {
        ans+=a[i];
        while (a[i]%2 == 0)
            {
                a[i] = a[i]/2;
               ans+=a[i];
                
            }
 
    // n must be odd at this point.  So we can skip 
    // one element (Note i = i +2)
         for (int k = 3; k <= sqrt(a[i]); k = k+2)
            {
                while (a[i]%k == 0)
                {
                    a[i] = a[i]/k;
                    ans+=a[i];
                }
            }
 
    // This condition is to handle the case when n 
    // is a prime number greater than 2
    if (a[i] > 2)
        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;
}