import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long longestSequence(long[] a) {
        long count=1;
        long count1=0;
        for(int i=0;i<a.length;i++){
            if(a[i]==1){
                count=count;
                count1=count1+count;
            }
            else if(a[i]%2==0){
                count=1;
                while(a[i]!=1){
                    count=count+a[i];
                    a[i]=a[i]/2;
                }
                count1=count1+count;
            }
            else if(a[i]%2!=0){
                int sqrt = (int) Math.sqrt(a[i]);
        if(sqrt*sqrt == a[i]) {
           count=count+sqrt+a[i];
        }else {
            count=count+a[i];
        }
                count1=count1+count;

            }
      //  System.out.println(count1);
        }
        
        return count1;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}