#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    long steps = 0;
    for (auto x : a) {
        steps += x + (x > 1);
        long i = 2;
        while (i * i <= x) {
            if (x % i == 0) {
                x /= i;
                steps += x;
            } else {
                ++i;
            }
        }
    }
    return steps;
}

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);
    cout << result << endl;
    return 0;
}