#include<iostream>
#include<vector>
using namespace std;
int g;
int highoddmul(int a)
{
int high;
for(int i=1;i<=a;i=i+2)
{
if(a%i==0)
high=i;
}
return(high);
}

long longestSequence(vector<long> a)
{
int i,noofparts,rempart,oddmul;
long count=0;
for(i=0;i<g;i++)
{
noofparts=1;
if(a[i]==1)
count++;
else if((a[i]%2==1)&&(a[i]!=1))
count=count+1+a[i];
else
{
rempart=a[i];
do
{
oddmul=highoddmul(rempart);
if(oddmul!=1)
{
	if(count==0)
	count++;
	else
	count=count+noofparts;
	rempart=rempart/oddmul;
	if(noofparts==0)
	noofparts=oddmul;
	else
	noofparts=noofparts*oddmul;
}
else
{
	if(count==0)
	count++;
	else
	count=count+noofparts;
	rempart=rempart/2;
	if(noofparts==0)
	noofparts=2;
	else
	noofparts=noofparts*2;
}
}while(rempart!=1);
count=count+a[i];
}
}
return(count);
}



int main()
{
	int n;
cin>>n;
g=n;
vector<long> a(n);
for(int i=0;i<n;i++)
cin>>a[i];
long result=longestSequence(a);
cout<<result<<endl;
return 0;
}