#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a,int n) {
    long ans = 0;
    for(int i=0;i<n;i++){
        long curr = a[i];
        ans += curr;
        long tmp_curr = curr;
        for(long j=2;j*j <= tmp_curr;j++){
            while(curr%j == 0){
                curr /= j;
                ans += curr;
            }
        }
        if(curr > 1){
            ans++;
        }
    }
    return ans;
}

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