#include <bits/stdc++.h>

using namespace std;
long f(long n)
{
    if(n==1)
        return 1;
    long i=2;
    while(!((n/i)%2==0 && n%i==0) && !(n/i==1 && n%i==0))
    {
        //cout<<n<<" i "<<i<<endl;
        i++;
    }
   // cout<<n<<" "<<i<<endl;
    return i*f(n/i)+1;
}

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

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