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

public class Solution {

    static long longestSequence(long[] a) {
        long c=0,d=0,q=0,l=0,z=0,k=0,b=0;
        for(int i=0;i<a.length;i++)
        {
                if(a[i]==1)
            {
             b=1;   
            }
       else if(a[i]%2==0)
        {
            c=a[i];
            while(c!=0)
            {
          c=c/2;
           d=d+c;
                //System.out.println("d--" +d);
            }
            k=d+a[i];
             //System.out.println("k--"+k);
        }
            
            else if(a[i]%2!=0)
            {
                for(int j=2;j<a[i];j++)
                {
                    if(j%a[i]==0)
                    {
                     q=j/a[i];
                       l=l+q+a[i];
                          //System.out.println("l--"+l);
                        break;
                    }
                    else
                    {
                    z=a[i]+1;
                          //System.out.println("z--"+z);
                    }
                        
                }
            }
        
           
        }
         return k+q+z+b;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}