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

public class Solution {

    static long longestSequence(long[] a,int n) {
        //  Return the length of the longest possible sequence of moves.
        long moves=0,ar,sum=0;
        for(int i=0;i<n;i++)
        {     
          if(a[i]==1)
          {
              moves+=1;
          }
            else if(a[i]%2==0)
            {   moves+=a[i];
                ar=a[i]/2;
                moves+=1;
                moves+=ar;
                
            }
            else if(a[i]%2!=0)
            {
                moves+=a[i];
                moves+=1;
            }
         
         sum=sum+moves;
        }
        return(sum);
    }

    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,n);
        System.out.println(result);
        in.close();
    }
}