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

public class Solution {

    static long longestSequence(long[] a) {
        Long x=0L;
        Long s=0L;
        for(int i = 0; i < a.length;i++)
        {          
            x=a[i];
            if(x%2!=0)
            {s=s+x+1;}
            else
            { 
                x=x/2;
                s=s+3*x+1;
            }
        }
        return s;
        //  Return the length of the longest possible sequence of moves.
    }

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