import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

 class Solution {

     
      public static void main(String[] args) {
        Scanner ob = new Scanner(System.in);
        
     int i,j,k;
        
        long sum=0L ;
        
       //   int temp=0;
          int n=1000000;
          
        int prime[] = new int[n+1];
        // Arrays.fill(prime,0); 
                                                              				 //0=true yes prime        
                                                                            //1=false not prime    
        for(int pv = 2; pv*pv <=n; pv++)
        {
            
            if(prime[pv] == 0)
            {
                
                for(int kv = pv*2; kv <= n; kv += pv)
                    prime[kv] = 1;
            }
        }
        
        int P[]=new int[1000000];
         
       int count=0;
        for(int kv = 2; kv <= n; kv++)
        {
            if(prime[kv] == 0)
			{
                P[count]= kv;
				count++;
	           }
		}
      //    System.out.println(count);
          
         int t=ob.nextInt(); 
          
        int temp=1,kp=0;
          
        for( i=0;i<t ;i++ )
        {
           long p=ob.nextLong();
            int flag=0;
            
           if(p==1L)
           {
               sum=sum+1;
               flag=1;
             
           }
            
           else
             {
              while(p>1L)
            {      
                flag=0;  
              for(  kp=0;kp<count;kp++ )
              {
                 if(p%P[kp]==0)
                 {
                    if(P[kp]==p)
                    {
                        sum=sum+ p+1;
                        flag=1;
                    //    temp=P[ kp ];
                        break;
                    }
                 else
                 {
           //      System.out.println(sum);
                    sum=sum+ p; 
                     flag=1;
                  break;   
                 }
                     
                 }
              }
                  
                 if(flag==1)
                 {
               p=p/ P[kp];
                 }
                  
                else
                 {   
            
                    break;
                 } 
              }   
          
           }
            
            
        if(flag==0)
            sum=sum+p+1;
            
     
            
     }
          
System.out.println(sum);
       
    }
}