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

int main() {  
    int n;
    cin >> n;
    LL ans = 0;
    for (int i = 0; i < n; i++) {
        LL t;
        cin >> t;
        vector<LL> factors;
        for(LL i = 2; i*i <= t; ++i) {
            while(t % i == 0) {
                factors.push_back(i);
                t /= i;
            }
        }
        if(t > 1) {
            factors.push_back(t);
        }    
        sort(factors.rbegin(), factors.rend());
        ans += 1;
        LL val = 1;
        for(LL fact: factors) {
            val *= fact;
            ans += val;
        }
    }
    cout << ans;
    return 0;
}