#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll prime(ll k){
    ll i;
    
    for(i=2;i<sqrt(k)+1;i++){
        if(k%i==0) return i;
    }
    return 0;
}
ll longestSequence(vector <ll> a) {
    //  Return the length of the longest possible sequence of moves.
    ll i;
    ll count=0,k;
    for(i=0;i<a.size();i++){
        ll s=prime(a[i]);
        k=a[i];
        if(s==0){if(k!=1)count+=(k+1); else count++;}
        else if(a[i]%2==0)
        {
        	while(k>0)
        	{
        		count+=k;
        	        k=k/2;
        		
        		s=prime(k);
        		//cout << k << endl;
        	   if(!s){if(k!=1)count+=(k+1); else count++; break;}
        	    if(k%2!=0)
        	    {
        	    	goto jump;
        	    }
        	}	
        }
        else if(a[i]%2!=0)
        {
        jump:
        	while(k>1)
        	{
        	//cout << s << " "<< k << " "<< count << endl;
        	   count+=k;
        	   s=prime(k);
        	   
        	   if(!s){count++; break;}
        	  k=k/s;
        	  
        	  
        	  
        	  
        	}
        	//count++;
        
        }
        
    }
    return count;
}

int main() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    for(ll a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    ll result = longestSequence(a);
    cout << result << endl;
    return 0;
}