/*#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
}

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;
}*/
#include <bits/stdc++.h>

using namespace std;

/*long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
}*/

int main() {
    int n=0, i=0, t=0, c=0, j=0, k=0;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    //long result = longestSequence(a);
    for(i=0;i<n;i++)
    {
        t=a[i];
        c+=t;
        for(j=2;j<=a[i];j++)
        {
            while(t%j==0)
            {
                c=c+(t/j);
                t=t/j;
            }
        }
    }
    cout<<c;
    //cout << result << endl;
    return 0;
}