#include "bits/stdc++.h"
using namespace std;
 
#define MAXN   1000002
 
// stores smallest prime factor for every number
int spf[MAXN];


long long int lpf[MAXN];
long long int res_val[MAXN];



// Calculating SPF (Smallest Prime Factor) for every
// number till MAXN.
// Time Complexity : O(nloglogn)
void sieve()
{
    spf[1] = 1;
    for (int i=2; i<MAXN; i++)
 
        // marking smallest prime factor for every
        // number to be itself.
        spf[i] = i;
 
    // separately marking spf for every even
    // number as 2
    for (int i=4; i<MAXN; i+=2)
        spf[i] = 2;
 
    for (int i=3; i*i<MAXN; i++)
    {
        // checking if i is prime
        if (spf[i] == i)
        {
            // marking SPF for all numbers divisible by i
            for (int j=i*i; j<MAXN; j+=i)
 
                // marking spf[j] if it is not 
                // previously marked
                if (spf[j]==j)
                    spf[j] = i;
        }
    }
}
 
// A O(log n) function returning primefactorization
// by dividing by smallest prime factor at every step
vector<int> getFactorization(int x)
{
    vector<int> ret;
    while (x != 1)
    {
        ret.push_back(spf[x]);
        x = x / spf[x];
    }
    return ret;
}




// A function to print all prime factors of a given number n
long long int  pf(long long int  n)
{
    long long int max_pf= 0 ;

    // Print the number of 2s that divide n
    while (n%2 == 0)
    {
        // printf("%d ", 2);
        n = n/2;
        max_pf= max(max_pf, 2ll );
    }
 
    // n must be odd at this point.  So we can skip 
    // one element (Note i = i +2)
    for (long long int i = 3; i*i <= n; i = i+2)
    {
        // While i divides n, print i and divide n
        while (n%i == 0)
        {
            // printf("%d ", i);
            n = n/i;
            max_pf= max(max_pf,i);
        }
    }
 
    // This condition is to handle the case when n 
    // is a prime number greater than 2
    if (n > 2)
        {
            // printf ("%d ", n);
            max_pf= max(max_pf,n);
        }
        return max_pf;
}



long long int fr(long long int x){

    if(x==1) return 1;

    long long int lpf_t;
    
    if(x<MAXN)
        if(res_val[x]!=0)
            return res_val[x];
        else
            lpf_t= lpf[x];
    else
        lpf_t= pf(x);

    return 1+ (lpf_t * fr(x/lpf_t)) ;


}




int main() {  
    sieve();
    
    int n;
    cin >> n;
  
    vector <long long> a(n);

    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
       


        for(int i=2;i<MAXN;i++){
        vector<int> res=getFactorization(i);
            lpf[i]= res.back();
            // long long int t= Largest_primeFactor(i);

            // if(lpf[i] != t){
            //     cout << i << "not " << lpf[i] << "   " << t << endl;
            // }

         //   cout <<  i << " " << lpf[i]    << endl;
        }
        
        
        for(int i=2;i<MAXN;i++){
        
            res_val[i]   = fr(i);

        }

        // for(int i=2; i< 30 ;i++){
        //     cout << i << " " << res_val[i] << endl;
        // }

    long long int s=0;
    
    for(int j=0;j<n;j++){

        s+=fr(a[j]);

    }
    
    cout << s << endl;
    
  
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}