#include <bits/stdc++.h>
using namespace std;
vector<int> prime;
const int MAXN = 2000000;
bool isPrimes[MAXN+200];

long long longestSequence(vector <long long> a) {
    memset(isPrimes, true, sizeof(isPrimes));
    for(int i=2;i*i<=MAXN;i++) 
        if(isPrimes[i]) 
            for(int j=i*i;j<=MAXN;j+=i)
                isPrimes[j] = false;
    
    for(int i=2;i<=MAXN;i++) 
        if(isPrimes[i])
            prime.push_back(i);
    
    long long ans = 0;
    for(int i=0;i<a.size();i++) {
        long long cur = a[i];
        
        vector<long long> ps;
        for(int j=0;j<prime.size();j++){
            while(cur % prime[j] == 0) {
                ps.push_back(prime[j]);
                cur /= prime[j];
            }
        }
        if(cur != 1) {
            ps.push_back(cur);
        }
        
        long long x = 1;
        ans += x;
        for(int j=ps.size()-1;j>=0;j--) {
            x *= ps[j];
            ans += x;
        }
    }
    return ans;
}

int main() {
    int n;
    cin >> n;
    vector<long long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long long result = longestSequence(a);
    cout << result << endl;
    return 0;
}