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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        
        long iTotalCount=0;
        
        for(int iCount=0;iCount<a.length;iCount++){
            
            if(a[iCount] ==1){
                iTotalCount++;
            }else if(a[iCount] % 2==1){
                iTotalCount+=a[iCount]+1;
            }else{
                long aValue=a[iCount];
                iTotalCount= ((aValue/2)+1)+aValue;
            }
        }
        return iTotalCount;
    }

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