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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        int n=a.length;
        long array[]=new long[n];
        
        for(int i=0;i<n;i++){
            array[i]=a[i];
        }
        long count=0;
        long mult=0;
        long total=0;
        for(int i=0;i<a.length;i++){
            
            if(array[i]%2==0){
                
               while(array[i]>1){
                   
                  if(array[i]%2==0){
                      count=count+array[i]/2;
                      mult=array[i]/count;
                      
                      if(array[i]>1){
                          array[i]=array[i]/2;
                          total=count*mult;
                      }
                      else{
                          total=total+array[i]+1;
                          break;
                      }
                     }
                   }
                 }
                else {
                      total=array[i]+1;
                      break;
                }
          }
        return total;
    }

    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();
    }
}