#include<stdio.h>
long long int longestSequence(long long int a_size,long long int *a)
{
	long long int i,t,sum=0,s=0,h,l,j;
	for(i=1;i<=a_size;i++)
	{
			if(a[i]!=1){
		
		s=a[i]+1;}
		else
		{
			s=1;
		}
		t=a[i];	
		if(t%2==0)
		{
			j=1;
			while((t%2==0)&&(t!=2)&&(t!=3))
			{
				t=t/2;
				s=s+2*j;
				j+2;
			}
			if(t!=1)
			{
				s=a[i]+1;
				t=a[i];
				t=t/3;
				s=s+3;
				j=1;
				while((t%2==0)&&(t!=2)&&(t!=3))
				{
					t=t/2;
					l=a[i]/t;
					s=s+l;
					j++;
				}
					
				
			}
		}
		sum=sum+s;
	}
	return sum;
}
int main()
{
	long long int n,i,a[9999],t,sum=0,s=0,h,l,j;
	scanf("%lld",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
	}
		
 
	l=longestSequence(n,a);
	printf("%lld\n",l);
	return 0;
}