#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
vector <long long> v;
void primeFactors(long long n)
{
    // Print the number of 2s that divide n
    while (n%2 == 0)
    {
        v.push_back(2);
        n = n/2;
    }
 
    // n must be odd at this point.  So we can skip 
    // one element (Note i = i +2)
    for (long long i = 3; i <= sqrt(n); i = i+2)
    {
        // While i divides n, print i and divide n
        while (n%i == 0)
        {
            v.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)
        v.push_back(n);
}

int main() {  
    long long n;
    cin >> n;
  long long ansf=0;
    vector <long long> a(n);
    for (long long i = 0; i < n; i++) {
        cin >> a[i];
        primeFactors(a[i]);
        sort(v.begin(),v.end(),std::greater<long long>());
        long long ans=1;long long cp=1;
        //for(int i=0;i<v.size();i++){cout<<v[i]<<" ";}cout<<endl;
        for(long long i=0;i<v.size();i++){
            ans+=cp*v[i];cp=cp*v[i];//cout<<ans<<" ";
        }
        ansf+=ans;
        v.clear();
    }cout<<ansf;
  
    
 
    return 0;
}