#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a,int n1) {
    //  Return the length of the longest possible sequence of moves.
    long c=0;
    for(int j=0;j<n1;j++)
    {
        while(a[j]>1)
        {
            c+=a[j];
            int d=0;
            if(a[j]%2==0)
                a[j]=a[j]/2;
            else
            {   for(long i=3;i*i<=a[j];i+=2)
                {
                    if(a[j]%i==0)
                    {
                        d=1;
                        a[j]=a[j]/i;
                        break;
                        
                    }
                }
                if (d==0)
                    a[j]=1;
            }
        }
        c=c+1;
    }
    return c;
}

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,n);
    cout << result << endl;
    return 0;
}