#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    
    int n = a.size();
    int bolen=1;
    int move_number=0;
    int move=0;
    int total_move=0;
    int bolum=0;
    int dizi_sayisi=1;
    int kontrol=0;
    
    
    
    for(int i=0;i<n;i++){
        
        
    vector <int> bolen_dizisi(a[i]);
    
    for(int aa=0;aa<a[i];aa++){
        bolen_dizisi[aa]=2;
    }
        
        if(a[i]==1){
            
            move++;
            
        }
        else{
            
            for(int j=(a[i]-1);j>1;j--){
                if(a[i]%j==0){
                    kontrol=1;
                    break;
                }
            }
       if(kontrol==1){   
            
            
        do{
            
            dizi_sayisi=dizi_sayisi*bolen;
            move_number=move_number+(dizi_sayisi);
         
            int k=0;
            
           int bolen_temp = a[i];
            bolen=bolen_temp;
            
         do{   
            
        
        
            
            
        do{
            bolen--;
            if(bolen==1){
                bolen=2;
            }
            
            
            
        }while(bolen_temp%bolen!=0);    
        
            bolen_dizisi[k]=bolen; 
             
              
             
             k++;
             
         }while(bolen!=2);
            
           
            
            int min=bolen_dizisi[0]-(a[i]/bolen_dizisi[0]);
            
            int temp_min;
            
            bolen=bolen_dizisi[0];
            
            for(int jj=1;jj<bolen_dizisi.size();jj++){
                
                 
                
                temp_min=bolen_dizisi[jj]-(a[i]/bolen_dizisi[jj]);
                
                if(temp_min>0 && temp_min<min){
                    
                    min=temp_min;
                    bolen=bolen_dizisi[jj];
                    
                   
                    
                }
                    
                
                
            }
            
            
        bolum=a[i]/bolen;
        a[i]=bolum;
             
          //cout<< bolen <<endl;    
        
        if(a[i]==1){
            
            dizi_sayisi=dizi_sayisi*bolen;
            move_number=move_number+(dizi_sayisi);
            
            
            
        }
            
            
                
             
        }while(a[i]!=1);
           
        
        }
            
            else{
                
                move_number = move_number + a[i] +1 ;
                
                a[i]=1;
                
            }
            
            kontrol=0;
    }
      
        
        total_move=total_move+move+move_number;
        move=0;
        move_number=0;
    }
    
    
    
    
    
    return total_move;
    
}

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