#include <bits/stdc++.h>

using namespace std;
bool sieve[1000002];
void soe()
{
    
    memset(sieve, true, sizeof(sieve));
 
    for (int p=2; p<=1000001; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (sieve[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=1000001; i += p)
                sieve[i] = false;
        }
    }
 
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    vector<int> v;
    soe();
    long sum=0;
    for (int p=2; p<=1000001; p++)
       if (sieve[p])
          v.push_back(p);
    for(int i=0;i<a.size();i++){
        for(int j=0;v[j]<=a[i]/2;j++){
            while(a[i]%v[j]==0){
                sum+=a[i];
                a[i]/=v[j];
            }   
        }
        if(a[i]>1)
            sum+=a[i];
        sum++;
    }
    return sum;
}

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;
}