#include <bits/stdc++.h>

using namespace std;

long p[1000010], sieve[1000010], co;

long longestSequence(vector <long> a) {
    long res = 0;
    for (int i=0;i<a.size();i++){
        long tp = a[i], total = a[i];
        for (int j=1;(p[j]*p[j]<=tp and j<=co);j++){
            if (tp%p[j] == 0){
                while (tp%p[j] == 0)
                    tp /= p[j], total+=tp;
            }
        }
        if (tp>1) total+=1;
        res += total;
    }
    return res;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    co = 0;
    for (int i=2;i<=1000000;i++){
        if (sieve[i]) continue;
        p[++co] = i;
        for (int j=i;j<=1000000/i;j++)
            sieve[i*j] = 1;
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}