#include <bits/stdc++.h>
#include <math.h> 
using namespace std;

bool isPrime(long long n)
{
    long long srt=sqrt(n);
    if((n%2==0))
    {
        return false;
    }
    for(int i=3;i<srt;i+=1)
    {
        if((n%i)==0)
        {
            return false;
        }
    }
    return true;
}
long long leastDivisor(long long n)
{
    n=(long long)n/2;
    for(int i=2;i<n;i++)
    {
        if((n%i)==0)
        {
            return i;
        }
    }
    return 1;
}
long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long long total=0,n;
    for(int i=0;i<a.size();i++)
    {
        n=a[i];
        while(n!=0)
        {
            if(n==1){
                total = total+1;
                n=0;
            }else if(isPrime(n))
       {
           
           total+=n+1;
            //cout<<n<<" "<<total<<endl;
           n=0;
           
       }
        else
        {
           if((n%2)==0 ) 
           {
               total=total+n;
               //cout<<n<<" "<<total<<endl;
               n=n/2;
           }
            else 
            {
                
            {
                total=total+n;
                //cout<<n<<" "<<total<<endl;
                n=leastDivisor(n);
            }
            }
        }
           
       }
    }
    
    return total;
}

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