#include <bits/stdc++.h>

using namespace std;
long mindiv(long n)
{
    long ret = n;
    for(long i = 2 ; i < (int)(sqrt(n)+1) ; i++)
    {
        if(n%i==0)
        {
            ret = i;
            break;
        }
    }
    return(ret);
}
long long int longestSequence(vector <long> v) {
    long long int sum = 0; 
    for(int i = 0 ; i < v.size();i++)
    {
        long imp = v[i];
        sum++;
        while(imp != 1)
        {
            sum += imp;
            imp = imp/mindiv(imp);
        }
    }
    return(sum);
    
    //  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;
}