#include <bits/stdc++.h>
#include <vector>
#include <algorithm>

using namespace std;

long primeFactorize(long n){
    vector<long> primeFactor;
    while (n%2 == 0)
    {
        primeFactor.push_back(2);
        n = n/2;
    }
 
    // n must be odd at this point.  So we can skip 
    // one element (Note i = i +2)
    for (int i = 3; i <= sqrt(n); i = i+2)
    {
        // While i divides n, print i and divide n
        while (n%i == 0)
        {
            //printf("%d ", i);
            primeFactor.push_back(i);
            n = n/i;
        }
    }
 
    // This condition is to handle the case when n 
    // is a prime number greater than 2
    if (n > 2)
        primeFactor.push_back(n);
        //printf ("%d ", n);
    int s=primeFactor.size();
   
        return primeFactor[s-1];
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long finalSum=0;
    for(int i=0;i<a.size();i++){
        vector<long> primeFactor;
        
        long sum=0,n=a[i],n_chip=1;
        while(n > 1){
            long p=primeFactorize(n);
           // cout<<p<<endl;
            n=n/p;
            //n_chip *= p;
            sum += n_chip;
            n_chip *= p;
        }
        sum += a[i];
        finalSum += sum;
    }
    return finalSum;
    
}

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