#include <bits/stdc++.h>

using namespace std;

long long smallestDivisor(long long n) {
    for (long long i = 2; i * i <= n; i++) {
        if (n % i == 0) return i;
    }
    return n;
}

long long longestSequence(vector <long long> a) {
    //  Return the length of the longest possible sequence of moves.
    long long total = 0;
    for (long long l : a) {
        long long cur = l, sum = l;
        while (cur > 1) {
            long long d = smallestDivisor(cur);
            cur = cur / d;
            sum += cur;
        }
        total += sum;
    }
    return total;
}

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