#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define ll long long int 
using namespace std;
ll memory[10000000];
ll power[30];
ll countSteps(ll n,ll numberOfSticks)
{ 
    ll i=0,total=0;
    ll k=n;
    while (n>1)
    {
        i=0;
        while (i<30 && power[i]!=n && n%power[i]==0)
        {
            i++;
        }
        total=total + numberOfSticks;   /// 1
        numberOfSticks = numberOfSticks*(n/power[i-1]);  /// 
        n=power[i-1];
    }
    return total + k;
}


int main() {  
    ll n,a[500],i,j,total=0;
    power[0]=1;
    for (i=1;i<30;i++)
    {
        power[i] = 2*power[i-1];
        ///cout<<power[i]<<" ";
    }
    
    cin >> n; 
    for (i=0;i<n;i++)
    {
        cin>>a[i];
        total = total + countSteps(a[i],1);
    }
    cout<<total;
    
    return 0;
}