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

vector<long long> factorize(long long x) {
    vector<long long> ans;
    ans.reserve(50);
    long long q = 2;
    while (x % q == 0) {
        ans.push_back(q);
        x /= q;
    }
    for (q = 3; q * q <= x; q += 2) {
        while (x % q == 0) {
            ans.push_back(q);
            x /= q;
        }
    }
    if (x > 1LL) {
        ans.push_back(x);
    }
    return ans;
}

long long break_stick(long long x) {
    auto fc = factorize(x);
    reverse(fc.begin(), fc.end());
    long long a = 1LL;
    long long ans = 1LL;    
    for (auto p : fc) {
        a *= p;
        ans += a;
    }
    return ans;
}

int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  
    long long ans = 0L;
    for (auto x : a) {
        ans += break_stick(x);
    }
    cout << ans << endl;
 
    return 0;
}