#include <bits/stdc++.h>

using namespace std;

vector<long long> factors;

long long solve(long long curr, long long cnt, int i){
    if(curr == 1)
        return 0;
    return cnt + solve(curr/factors[i], cnt * factors[i], i-1);
}
void fact(long long x){
    for(int i=2; 1LL*i*i<=x;i++)
        while(x%i == 0)
            x /= i, factors.push_back(i);
    if(x>1)
        factors.push_back(x);
}

long long longestSequence(vector <long long> a) {
    long long ans = 0;
    for(int i = 0;i<a.size();i++) {
        factors.clear();
        fact(a[i]);
        ans += a[i] + solve(a[i],1,factors.size()-1);
    }
    return ans;
}

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