#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {  
    int n;long int moves=1;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
       int isPrime = 1; 

    for(int j=2; j<=a[i]/2; j++)
    {
        if(a[i]%j==0)
        {
            isPrime = 0;
             break;
        }
    }
         if(isPrime == 1){
            moves+=a[i]+1; //cout<<moves<<endl;
         }
         
        
        else{
          
            moves+=a[i];
            int a1=a[i]/2;
            
            while(a1%2==0){
                moves+=a1;   //cout<<a1<<'*'<<endl;
                a1=a1/2;
              
               
                //cout<<moves<<endl;
            }//cout<<a1<<endl;
            while(a1%3==0){
                moves+=a1;
                if(a1%3==0){moves+=a1%3;a1=a1/3;}
               else{
                   a1=(a1-1)/2;  if(a1%2==0)moves+=1;
               } 
              
                    //cout<<a1<<endl;
            }
            
        }

    }
  if(n>1)
    cout<<moves-1<<endl;
    else
        cout<<moves<<endl;
    
 
    return 0;
}