#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

typedef long long llong;

int main() {    
    vector<bool> prime(1000000, true);
    
    for(int i=2; i*i<1000000; ++i)
        if(prime[i])
            for(int j=i*i; j<=1000000; j+=i)
                prime[j]=false;
    
    vector<llong> primes;
    for(int i=2; i<1000000; ++i)
        if(prime[i])
            primes.push_back(i);
    
    int n;
    cin >> n;

    llong ans=0;
    for (int i = 0; i < n; i++) {
        llong a;
        cin >> a;

        vector<long long> pfactors;
        vector<long long> cnts;
        for(llong p: primes) {
            if(a%p==0)
                pfactors.push_back(p), cnts.push_back(0);
                
            while(a%p ==0) {
                a/=p;
                ++cnts.back();
            }
        }
        
        if(a>1)
            pfactors.push_back(a), cnts.push_back(1);

        llong steps=0;
        llong pieces=1;
        
        for(int i=pfactors.size()-1; i>=0; --i)
        for(int j=0; j<cnts[i]; ++j)
            steps += pieces, pieces*=pfactors[i];
        
        steps += pieces;
        ans += steps;
    }
  
    /* Enter your code here. Print output to STDOUT */   
    cout << ans;
    return 0;
}