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


vector<long long> primefactors(long long el) {
    long long i, j= el;
    vector<long long> pfs;
    for (i=2;i*i<=el;i++) {
        while (j%i==0) {
            pfs.push_back(i);
            j /= i;
        }
    }
    if (j>1) {
        pfs.push_back(j);
    }
    //cout << el<< endl;
    return pfs;
}


long long getmoves(long long el) {
    //cout << el << endl;
    vector<long long> pfs = primefactors(el);
    long long count =1;
    for (long long p: pfs) {
        //cout << p<<endl;
        count = count*p + 1;
    }
    return count;
}


int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  
    /* Enter your code here. Print output to STDOUT */
    long long ans =0;
    
    for (long long el: a) {
        ans += getmoves(el);
    }
    
    cout << ans << endl;
    
 
    return 0;
}