#include <bits/stdc++.h>

using namespace std;

long longestSequence(long a) {
    int sq=sqrt(a);
    for (int i=2; i<=sq; i++) if (a%i==0) return a+longestSequence(a/i);
    if (a>1) return a+1;
    else return 1;
}

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=0;
    for (int i=0; i<n; i++) result+=longestSequence(a[i]);
    cout << result << endl;
    return 0;
}