#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    long totalSum = 0;
    for (int i = 0; i < a.size(); i++) {
        long sum = 1;
        long v = a[i];
        while (v > 1) {
            bool change = false;
            sum += v;
            for (long j = 2; j*j <= v; j++) {
                if (v % j == 0) {
                    v = v / j;
                    change = true;
                    break;
                }
            }
            if (!change) {
                break;
            }
        };
        totalSum += sum;
    }
    return totalSum;
}

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;
}