#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    long int result = 0;
    for(int x_i=0; x_i < a_size ; x_i++) {
        //
        if(a[x_i] == 1) {
            result+=2;
            printf("%ld \n", result);
        }
        if(a[x_i]%2 == 0 && a[x_i]!= 1) {
            // prin#tf("%ld \n",result);
           result+= (1+(a[x_i]/2)+a[x_i]);
           printf("%ld \n",result);   
        }
         if (a[x_i]%2 !=0 && a[x_i]!=1) {
            result = result + a[x_i] + 1;
        }
        
    }
    return result;
}

int main() {
    int n; 
    scanf("%i", &n);
    long int *a = malloc(sizeof(long int) * n);
    for (int a_i = 0; a_i < n; a_i++) {
       scanf("%li",&a[a_i]);
    }
    long int result = longestSequence(n, a);
    printf("%ld\n", result);
    return 0;
}