#include <bits/stdc++.h>

using namespace std;

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

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long sum = 0;
    for(int i=0; i<a.size(); i++)
    {
        long n = a[i];
        long count = 1;
        while(n>1)
        {
            count+=n;
            long d = find_divisor(n);
            n = n/d;
        }
        sum+=count;
    }
    return sum;
}

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