import java.util.*;
public class breakingsticks {

	public static void main(String[] args) 
	{	 	
     Scanner sc = new Scanner(System.in);
     int n = sc.nextInt();
     int a[]=new int[n];
     for(int i=0;i<n;i++)
     {
      a[i]=sc.nextInt();
     }
     fun1(a);
     sc.close();
	}
	//For accessing the array elements
	public static void fun1(int[] a)
	{
	 int ans=0;
	 for(int i=0;i<a.length;i++)
	 {
	  ans=ans+fun2(a[i])+1;
	 }
	 System.out.println(ans);
	}
	//For breaking the sticks
	public static int fun2(int x)
	{
	 int count=0;
	 if(isprime(x)) // Returning the number itself if it is a prime
	 {
	  return x;	 
	 }
	  // if the number is even then checking for which nearest power of 2 it is divisible
	  if(x%2==0)
	  {
	  int z=x;
	  int c=0,d=0;
	  while(z>1) 
	  {
	   z=z/2;
	   c++;
	  }
	  for(int i=c;i>=0;i--)
	  {
	   if(x%(Math.pow(2,i))==0)
	   {
		d=i;   
	   }
	  }
	  count=count+(int)Math.pow(2,d);
	  fun2((int)Math.pow(2,d));
	  }
	  return count;	
	}
	// number is prime or not
	public static boolean isprime(int y)
	{
	 boolean flag=false;
	 for(int i=2;i<Math.sqrt(y);i++)
	 {
	  if(y%i==0)
	  {
	   flag=false;
	   break;   
	  }
	  else
	  {
	   flag=true;
	  }
	 }
	 return flag;
	}
}