#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    int d,ans=0,sum=0,r=0;
    for(int i=0;i<a.size();i++){
        sum=1;
        for(int j=1;j<=a[i];j++){
            if(a[i]%j==0&&log2(a[i]/j)==floor(log2(a[i]/j))){
                d=j;
                break;
            }
        }
        r=d;
        while(r<=a[i]){
            sum+=r;
            r*=2;
        }
        if(a[i]==1) sum=1;
        ans+=sum;
    }
    return ans;
}

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