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) {
    long sum1=0;
        long res=0;
        long[] sum = new long[n];
        int i;    
        for(i=0;i<n;i++)
        {
            if(a[i]==1)
            {
                sum1=1;
                sum[i]=sum1;
            }
            else if(a[i]%2==0)
            {
            sum1=a[i]/2;
            sum[i]=n+sum1+sum1*2;
            }
            else if(a[i]%2!=0)
            {
               sum1=1+a[i]/2;
            sum[i]=n+sum1+sum1*2;
        }
        }
        for(i=0;i<n;i++)
        {
            res=res +sum[i];
        }
        return res;
    }

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