process.stdin.resume();
process.stdin.setEncoding('ascii');

var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;

process.stdin.on('data', function (data) {
    input_stdin += data;
});

process.stdin.on('end', function () {
    input_stdin_array = input_stdin.split("\n");
    main();    
});

function readLine() {
    return input_stdin_array[input_currentline++];
}

/////////////// ignore above this line ////////////////////

function longestSequence(a) {
    //  Return the length of the longest possible sequence of moves.
    var maxSequence = 0;
    for(var i=0;i<a.length;i++){
       var calcuteMax = 0;
        if(a[i]>1){
           maxSequence = maxSequence + a[i]+ getEachMax(a[i]); 
        }
        else{
           maxSequence = maxSequence + a[i]; 
        }
        
    }
    return maxSequence;
}
 
function getEachMax(num){
    var sum = 0;
     if(num%2 == 0){
         sum =  num/2 + getEachMax(num/2); 
     }
    else{
        sum = sum+1;
    }
   
      return sum;

}
function main() {
    var n = parseInt(readLine());
    a = readLine().split(' ');
    a = a.map(Number);
    var result = longestSequence(a);
    process.stdout.write("" + result + "\n");

}